Увійти

Готові списки джерел за темами / Shortest path search in network / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Shortest path search in network.

Статті в журналах з теми "Shortest path search in network"

Автор: Grafiati

Опубліковано: 30 травня 2022

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Shortest path search in network".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Schneck, Arne, and Klaus Nökel. "Accelerating Traffic Assignment with Customizable Contraction Hierarchies." Transportation Research Record: Journal of the Transportation Research Board 2674, no. 1 (2020): 188–96. http://dx.doi.org/10.1177/0361198119898455.

Повний текст джерела

Анотація:

In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conju

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Guo, Ya Fei, Zheng Qin, Rong Hua Guo, and Lei Ji. "SH: A Novel Method for the Dynamic and Shortest Path Problem." Advanced Materials Research 129-131 (August 2010): 1013–17. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.1013.

Повний текст джерела

Анотація:

For the dynamic and shortest path problem, a novel algorithm SH(simulate human) is designed by simulating the process of our searching path in real life. The algorithm adopts the idea of heuristic search and integrates with the ant colony algorithm, in which the saved current path, the idea of “ask once every junction”, the bypassing barrier search and other some related definitions are proposed, as well as the ant colony algorithm is improved, so as to find the better solution and reduce the searching time. The experimental results show that the algorithm runs better than other existing metho

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Yuan, C., and B. Malone. "Learning Optimal Bayesian Networks: A Shortest Path Perspective." Journal of Artificial Intelligence Research 48 (October 16, 2013): 23–65. http://dx.doi.org/10.1613/jair.4039.

Повний текст джерела

Анотація:

In this paper, learning a Bayesian network structure that optimizes a scoring function for a given dataset is viewed as a shortest path problem in an implicit state-space search graph. This perspective highlights the importance of two research issues: the development of search strategies for solving the shortest path problem, and the design of heuristic functions for guiding the search. This paper introduces several techniques for addressing the issues. One is an A* search algorithm that learns an optimal Bayesian network structure by only searching the most promising part of the solution spac

Стилі APA, Harvard, Vancouver, ISO та ін.

4

LONG, Ke-jun, Lee D. HAN, and Sai-zheng WANG. "Shortest path search in road network with incomplete information." Journal of Computer Applications 31, no. 3 (2011): 651–53. http://dx.doi.org/10.3724/sp.j.1087.2011.00651.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Bilò, Davide, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, and Martin Schirneck. "Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 25 (2025): 26463–71. https://doi.org/10.1609/aaai.v39i25.34846.

Повний текст джерела

Анотація:

We design sensitivity oracles for error-prone networks. For a network problem Π, the data structure preprocesses a network G=(V,E) and sensitivity parameter f such that, for any set F of up to f link or node failures, it can report the solution of Π in G-F. We study three network problems Π. - L-Hop Shortest Path: Given s,t in V, is there a shortest s-t-path in G-F with at most L links? - k-Path: Does G-F contain a simple path with k links? - k-Clique: Does G-F contain a clique of k nodes? Our main technical contribution is a new construction of (L,f)-replacement path coverings ((L,f)-RPC) in

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Hui, Shumin, and Yuefei Wang. "Research on the Social Network Search Strategy from the Viewpoint of Comprehensive Influence Maximization." Journal of Advanced Computational Intelligence and Intelligent Informatics 27, no. 6 (2023): 1037–44. http://dx.doi.org/10.20965/jaciii.2023.p1037.

Повний текст джерела

Анотація:

Considering that social network provides a channel for nodes to exchange information, resources, and interests, the fundamental task of social network search is to find the best path from the source node to the target node. The search strategy based on the shortest path principle ignores the strength and direction of the social relationship between nodes in the social network, and ignores the difference of influence between nodes, so that the search results cannot meet the needs of searchers. Considering the important role of the influence of nodes and the influence intensity between nodes in

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Wang, Zhengdong, Yifeixue Yang, Ziyi Huang, et al. "Exploring the transmission of cognitive task information through optimal brain pathways." PLOS Computational Biology 21, no. 3 (2025): e1012870. https://doi.org/10.1371/journal.pcbi.1012870.

Повний текст джерела

Анотація:

Understanding the large-scale information processing that underlies complex human cognition is the central goal of cognitive neuroscience. While emerging activity flow models demonstrate that cognitive task information is transferred by interregional functional or structural connectivity, graph-theory-based models typically assume that neural communication occurs via the shortest path of brain networks. However, whether the shortest path is the optimal route for empirical cognitive information transmission remains unclear. Based on a large-scale activity flow mapping framework, we found that t

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Lu, Pan, Chuanfang Jing, and Xiaorong Zhu. "GraphSAGE-Based Multi-Path Reliable Routing Algorithm for Wireless Mesh Networks." Processes 11, no. 4 (2023): 1255. http://dx.doi.org/10.3390/pr11041255.

Повний текст джерела

Анотація:

Wireless mesh networks (WMN) promise to be an effective way to solve the “last mile” access problem on the Internet of Things (IoT) and the key to next-generation wireless networks. The current routing algorithms of WMN are difficult to adapt to complex environments and guarantee the reliable transmission of services. Therefore, this paper proposes a reliable routing algorithm that combines the improved breadth-first search and a graph neural network, namely GraphSAGE. The algorithm consists of two parts: (1) A multi-path routing algorithm based on the improved breadth-first search. This algor

Стилі APA, Harvard, Vancouver, ISO та ін.

9

杨, 颖. "The Shortest Path Search of Radio Broadcast Model Based on Path Network." Computer Science and Application 08, no. 12 (2018): 1798–803. http://dx.doi.org/10.12677/csa.2018.812199.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Zhang, Shuijian, Xuejun Liu, and Meizhen Wang. "A novel ant colony optimization algorithm for the shortest-path problem in traffic networks." Filomat 32, no. 5 (2018): 1619–28. http://dx.doi.org/10.2298/fil1805619z.

Повний текст джерела

Анотація:

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important combinatorial optimization problem in network optimization. In this paper, a novel algorithm based on ACO to solve the single-pair shortest-path problem in traffic networks is introduced. In this algorithm, a new strategy is developed to find the best solution in a local search, by which the ants seek the shortest path using both a pheromone-trail-following mechanism and an orientation-guidance mechanism. A n

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Shi, Yuanji, Zhiwei Yuan, Xiaorong Zhu, and Hongbo Zhu. "An Adaptive Routing Algorithm for Inter-Satellite Networks Based on the Combination of Multipath Transmission and Q-Learning." Processes 11, no. 1 (2023): 167. http://dx.doi.org/10.3390/pr11010167.

Повний текст джерела

Анотація:

In a satellite network, the inter-satellite link can facilitate the information transmission and exchange between satellites, and the packet routing of the inter-satellite link is the key development direction of satellite communication systems. Aiming at the complex topology and dynamic change in LEO satellite networks, the traditional single shortest path algorithm can no longer meet the optimal path requirement. Therefore, this paper proposes a multi-path routing algorithm based on an improved breadth-first search. First, according to the inter-satellite network topology information, the im

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Anand, Neetu, Kanishka Kharbanda, and Yash Raj Singh. "A* Algorithm — based shortest path search for the road network." JIMS8I International Journal of Information Communication and Computing Technology 11, no. 1 (2023): 639–45. http://dx.doi.org/10.5958/2347-7202.2023.00002.6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Wei, Haitao, Shusheng Zhang, and Xiaohui He. "Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model." Sensors 21, no. 1 (2020): 203. http://dx.doi.org/10.3390/s21010203.

Повний текст джерела

Анотація:

Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted se

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Valdés, Lissette, Alfonso Ariza, Sira M. Allende, Alicia Triviño, and Gonzalo Joya. "Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions." Symmetry 13, no. 8 (2021): 1534. http://dx.doi.org/10.3390/sym13081534.

Повний текст джерела

Анотація:

A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with pr

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Thapa, R., and J. K. Shrestha. "Optimal Route Computation for Public Transport with Minimum Travelling Time & Travel Cost: A Case Study of Pokhara City." Technical Journal 1, no. 1 (2019): 79–86. http://dx.doi.org/10.3126/tj.v1i1.27595.

Повний текст джерела

Анотація:

In road networks, it is imperative to discover a shortest way to reach the final destination. When an individual is new to a place, lots of time is wasted in finding the destination. With the advancement of technology, various navigation applications have been developed for guiding private vehicles, but few are designed for public transportation. This study is solely concentrated on finding the possible shortest path in terms of minimum time and cost to reach specific destination for an individual. It requires an appropriate algorithm to search the shortest path. With the implementation of Dij

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Sun, Ya Qi, Yu Liu, and Kuo Hua Xiao. "Shortest Travel Path Searching System Based on Dijkstra Algorithm." Applied Mechanics and Materials 198-199 (September 2012): 1395–98. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.1395.

Повний текст джерела

Анотація:

The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to use the advantage of Dijkstra algorithm, the Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the Dijkstra algorithm can accomplish a good result in search efficiency.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

YU, Ning. "Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm." Promet - Traffic&Transportation 36, no. 6 (2024): 1120–32. https://doi.org/10.7307/ptt.v36i6.749.

Повний текст джерела

Анотація:

Unbalanced urban development causes complex and diverse urban traffic conditions, which complicates microcirculation traffic network planning. To address this, a method based on fast search random tree algorithm is proposed. An urban microcirculation traffic network is constructed using directed graphs, and road network interference intensity and capacity are calculated. The interpolation collision detection method is used to determine the shortest path while considering constraint conditions. By incorporating target gravity into the RRT algorithm, a growth guidance function is obtained, optim

Стилі APA, Harvard, Vancouver, ISO та ін.

18

SITORUS, IRMA YOLANDA, and PENDA SUDARTO HASUGIAN. "Shortest These search Heading Attractions Lubukpakam Using Greedy Algorithm." Journal Of Computer Networks, Architecture and High Performance Computing 2, no. 2 (2020): 245–49. http://dx.doi.org/10.47709/cnapc.v2i2.417.

Повний текст джерела

Анотація:

In the case of this shortest route search actually has many different types of solutions for path searching, for example the greedy algorithm, dijkstra, floyd-warshall and bellman-ford but what is commonly used to solve this problem is the Greedy algorithm because this algorithm is an algorithm that uses a problem solving approach with look for a temporary maximum value at each step. Of all the tourist attractions such as the Fruit Garden, Deli Serdang Swimming Pool, Deli Serdang Museum, Deli Serdang Regency Government Square, Tengku Raja Muda Field, the writer will look for the shortest path

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Takahashi, Natsumi, Tomoaki Akiba, Shuhei Nomura, and Hisashi Yamamoto. "An Approach for the Fast Calculation Method of Pareto Solutions of a Two-objective Network." International Journal of Reliability, Quality and Safety Engineering 22, no. 01 (2015): 1550005. http://dx.doi.org/10.1142/s0218539315500059.

Повний текст джерела

Анотація:

The shortest path problem is a kind of optimization problem and its aim is to find the shortest path connecting two specific nodes in a network, where each edge has its distance. When considering not only the distances between the nodes but also some other information, the problem is formulated as a multi-objective shortest path problem that involves multiple conflicting objective functions. The multi-objective shortest path problem is a kind of optimization problem of multi-objective network. In the general cases, multi-objectives are rarely optimized by a solution. So, to solve the multi-obj

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Blum, Johannes, Stefan Funke, and Sabine Storandt. "Sublinear search spaces for shortest path planning in grid and road networks." Journal of Combinatorial Optimization 42, no. 2 (2021): 231–57. http://dx.doi.org/10.1007/s10878-021-00777-3.

Повний текст джерела

Анотація:

AbstractShortest path planning is a fundamental building block in many applications. Hence developing efficient methods for computing shortest paths in, e.g., road or grid networks is an important challenge. The most successful techniques for fast query answering rely on preprocessing. However, for many of these techniques it is not fully understood why they perform so remarkably well, and theoretical justification for the empirical results is missing. An attempt to explain the excellent practical performance of preprocessing based techniques on road networks (as transit nodes, hub labels, or

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Bi, Jun, Jie Zhang, and Wen Le Xu. "An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network." Applied Mechanics and Materials 121-126 (October 2011): 1296–300. http://dx.doi.org/10.4028/www.scientific.net/amm.121-126.1296.

Повний текст джерела

Анотація:

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in de

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Setiadi, Teguh. "PENCARIAN JALUR TERPENDEK MENUJU POM BENSIN PADA KOTA SEMARANG MENGGUNAKAN ALGORITMA DIJKSTRA BERBASIS SISTEM INFORMASI GEOGRAFIS (GIS)." JURNAL TEKNOLOGI INFORMASI DAN KOMUNIKASI 8, no. 2 (2020): 53–63. https://doi.org/10.51903/jtikp.v8i2.181.

Повний текст джерела

Анотація:

The search for the shortest route has been applied in many fields to optimize the performance of a system, such as minimizing costs or speeding up a process. The search for the shortest path applied to the roads in many countries has reduced time, travel cost and the inconvenience of the drivers and the passengers. A number of heuristic algorithm approaches have been suggested to reduce the computational time of the shortest path and developed to identify, classify, and compute accurately. The problem to be solved is to find the optimal path in a city’s roads network from the starting path to

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Mo, Tai Ping, Hui Huang Zhao, and Wei Mo. "Design and Implementation of Shortest Travel Path Searching Based on Improved Dijkstra Algorithm." Applied Mechanics and Materials 157-158 (February 2012): 390–94. http://dx.doi.org/10.4028/www.scientific.net/amm.157-158.390.

Повний текст джерела

Анотація:

The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to improve the disadvantage of tradition Dijkstra algorithm, an improve algorithm was proposed to improve the path search efficiency. Then the improved Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the improved Dijkstra algorithm can accomplish a better r

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Feiroz Khan, T. H., and D. Siva Kumar. "An obstacle aware mobile sink path strategy in WSN." Indonesian Journal of Electrical Engineering and Computer Science 15, no. 2 (2019): 879. http://dx.doi.org/10.11591/ijeecs.v15.i2.pp879-887.

Повний текст джерела

Анотація:

<span>In Wireless Sensor Networks, Mobile Sink accomplishes considerable achievement on network lifetime improvement. In sensing environment, more chances to present the obstacle. But, in the mobile sink, how to identify the obstacle and make the obstacle aware path strategy is a challenging task. To overcome this problem, we propose an Obstacle Aware Mobile sink Path Strategy (OAMPS) that detects any obstacles which enter within the network lifetime and design a shortest mobile sink movement path avoiding detected obstacles. In this scheme, the mobile sink collects the sensing data from

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Fedorov, Eugene, Olga Nechyporenko, Maryna Chychuzhko, Vladyslav Chychuzhko, and Ruslan Leshchenko. "NEURAL NETWORK-BASED METHODS FOR FINDING THE SHORTEST PATH and establishing associative connections between objects." Radioelectronic and Computer Systems, no. 2 (May 25, 2023): 54–64. http://dx.doi.org/10.32620/reks.2023.2.05.

Повний текст джерела

Анотація:

Nowadays, solving optimizations problems is one of the tasks for intelligent computer systems. Currently, there is a problem of insufficient efficiency of optimizations tasks solving methods (for example, high computing time and/or accuracy). The object of the research is the process of finding the shortest path and establishing associative connections between objects. The subject of the research is the methods of finding the shortest path and establishing associative connections between objects based on neural networks with associative memory and neural network reinforcement training. The obj

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Zhou, Wei Teng, Bao Ming Han, and Hao Dong Yin. "Study on the K-Shortest Paths Searching Algorithm of Urban Mass Transit Network Based on the Network Characteristics." Applied Mechanics and Materials 505-506 (January 2014): 689–97. http://dx.doi.org/10.4028/www.scientific.net/amm.505-506.689.

Повний текст джерела

Анотація:

K-shortest path is of great significance for urban rail mass transit operation and management especially in large-scale network. The paper has analyzed composite structure characteristics and proposed the route features of the network. According to the former analyses, the author put forward a new method to build a double-layer network model based on the train operation with the corresponding double-layer searching algorithm to solve the model in order to obtain the k-shortest paths. Finally, the rationality and effectiveness of the algorithm had been verified through the examples, which prove

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Jiang, Junhui, Shanyu Jin, Xinghan Li, Kaisong Zhang, and Baodan Sun. "A Zero-Touch Dynamic Configuration Management Framework for Time-Sensitive Networking (TSN)." Entropy 27, no. 6 (2025): 584. https://doi.org/10.3390/e27060584.

Повний текст джерела

Анотація:

As Industry 5.0 progresses, the demand for zero-touch configuration in industrial automation and smart manufacturing is increasing. This paper proposes a dynamic configuration management framework for Time-Sensitive Networking (TSN), aiming to address the challenges of flexibility and adaptability in dynamic network environments. A zero-touch configuration model is presented for TSN by incorporating a Delay-Aware Shortest Path Search (DASPS) algorithm to improve scheduling success rates. Simulation results demonstrate the ability of the framework to reconfigure networks within 2.67 millisecond

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Ahmadi, Saman, Andrea Raith, Guido Tack, and Mahdi Jalili. "Resource Constrained Pathfinding with Enhanced Bidirectional A* Search." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 25 (2025): 26878–85. https://doi.org/10.1609/aaai.v39i25.34892.

Повний текст джерела

Анотація:

The classic Resource Constrained Shortest Path (RCSP) problem aims to find a cost optimal path between a pair of nodes in a network such that the resources used in the path are within a given limit. Having been studied for over a decade, RCSP has seen recent solutions that utilize heuristic-guided search to solve the constrained problem faster. Building upon the bidirectional A* search paradigm, this paper introduces a novel constrained search framework that uses efficient pruning strategies to allow for accelerated and effective RCSP search in large-scale networks. Results show that, compared

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Shin, Sung-Hyun, Sang-Wook Kim, Junghoon Lee, Sang-Chul Lee, and EulGyu Im. "Efficient Shortest Path Search in Large Road Network Environment: A Heuristic Approach." IETE Journal of Research 57, no. 6 (2011): 530. http://dx.doi.org/10.4103/0377-2063.92269.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Shen, Hongmin, and Hongzhou Pan. "Architecture Design and Code Implementation of Road Network Path Search System." Wireless Communications and Mobile Computing 2022 (May 26, 2022): 1–14. http://dx.doi.org/10.1155/2022/4235523.

Повний текст джерела

Анотація:

Path search is a hot issue in computer science and artificial intelligence science. When the user enters the starting point and ending point to be queried in the road network path search system, the system will return the best path to the user. In this paper, the road network path search system that can run and calculate the optimal navigation path to the test data is developed by designing the software architecture through the comprehensive use of database design, programming language, shortest path algorithm, UML diagram, software development model, GIS system source data, and other methods.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Yang, Bowen, Jin Yan, Zhi Cai, et al. "A Novel Heuristic Emergency Path Planning Method Based on Vector Grid Map." ISPRS International Journal of Geo-Information 10, no. 6 (2021): 370. http://dx.doi.org/10.3390/ijgi10060370.

Повний текст джерела

Анотація:

Emergency path planning technology is one of the research hotspots of intelligent transportation systems. Due to the complexity of urban road networks and congested road conditions, emergency path planning is very difficult. Road congestion caused by urban emergencies directly affects the original road network structure. In this way, the static weight of the original road network is no longer suitable as the basis for path recommendation. To handle the dynamic situational road network, an equidistant grid emergency path planning framework will be designed. A novel situation grid road network m

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Li, Peng, and Rui Feng Wang. "The Research on Shortest Path Base on Yantai Vocational College." Advanced Materials Research 482-484 (February 2012): 368–71. http://dx.doi.org/10.4028/www.scientific.net/amr.482-484.368.

Повний текст джерела

Анотація:

This paper based on the complex network, this paper expounds the advantages and disadvantages of traditional shortest path algorithm, this paper puts forward the traditional path finding algorithm of the improved algorithm, the improved algorithm is compared with the traditional algorithm between the search efficiency, and all the differences between the improved algorithm to solve complex network in size, number of nodes under the condition of the shortest path problem. The test shows that the improved algorithm efficiency in the later has obviously advantages, which are embodied in the space

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Prihozhy, A. A. "Generation of shortest path search dataflow networks of actors for parallel multi-core implementation." Informatics 20, no. 2 (2023): 65–84. http://dx.doi.org/10.37661/1816-0301-2023-20-2-65-84.

Повний текст джерела

Анотація:

Objectives. The problem of parallelizing computations on multicore systems is considered. On the Floyd – Warshall blocked algorithm of shortest paths search in dense graphs of large size, two types of parallelism are compared: fork-join and network dataflow. Using the CAL programming language, a method of developing actors and an algorithm of generating parallel dataflow networks are proposed. The objective is to improve performance of parallel implementations of algorithms which have the property of partial order of computations on multicore processors.Methods. Methods of graph theory, algori

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Goldfarb, Donald, Jianxiu Hao, and Sheng-Roan Kai. "Shortest path algorithms using dynamic breadth-first search." Networks 21, no. 1 (1991): 29–50. http://dx.doi.org/10.1002/net.3230210105.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Wu, Ter-Feng, Pu-Sheng Tsai, Nien-Tsu Hu, and Jen-Yang Chen. "Combining turning point detection and Dijkstra’s algorithm to search the shortest path." Advances in Mechanical Engineering 9, no. 2 (2017): 168781401668335. http://dx.doi.org/10.1177/1687814016683353.

Повний текст джерела

Анотація:

In this study, image processing was combined with path-planning object-avoidance technology to determine the shortest path to the destination. The content of this article comprises two parts: in the first part, image processing was used to establish a model of obstacle distribution in the environment, and boundary sequence permutation method was used to conduct orderly arrangement of edge point coordinates of all objects, to determine linking relationship between each edge point, and to individually classify objects in the image. Then, turning point detection method was used to compare the ang

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Kusetogullari, Huseyin, Md Haidar Sharif, Mark S. Leeson, and Turgay Celik. "A Reduced Uncertainty-Based Hybrid Evolutionary Algorithm for Solving Dynamic Shortest-Path Routing Problem." Journal of Circuits, Systems and Computers 24, no. 05 (2015): 1550067. http://dx.doi.org/10.1142/s021812661550067x.

Повний текст джерела

Анотація:

The need of effective packet transmission to deliver advanced performance in wireless networks creates the need to find shortest network paths efficiently and quickly. This paper addresses a reduced uncertainty-based hybrid evolutionary algorithm (RUBHEA) to solve dynamic shortest path routing problem (DSPRP) effectively and rapidly. Genetic algorithm (GA) and particle swarm optimization (PSO) are integrated as a hybrid algorithm to find the best solution within the search space of dynamically changing networks. Both GA and PSO share context of individuals to reduce uncertainty in RUBHEA. Vari

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Ma, Tianli, Song Gao, Chaobo Chen, and Xiaoru Song. "Multitarget Tracking Algorithm Based on Adaptive Network Graph Segmentation in the Presence of Measurement Origin Uncertainty." Sensors 18, no. 11 (2018): 3791. http://dx.doi.org/10.3390/s18113791.

Повний текст джерела

Анотація:

To deal with the problem of multitarget tracking with measurement origin uncertainty, the paper presents a multitarget tracking algorithm based on Adaptive Network Graph Segmentation (ANGS). The multitarget tracking is firstly formulated as an Integer Programming problem for finding the maximum a posterior probability in a cost flow network. Then, a network structure is partitioned using an Adaptive Spectral Clustering algorithm based on the Nyström Method. In order to obtain the global optimal solution, the parallel A* search algorithm is used to process each sub-network. Moreover, the trajec

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Yang, Yajun, Zhongfei Li, Xin Wang, and Qinghua Hu. "Finding the Shortest Path with Vertex Constraint over Large Graphs." Complexity 2019 (February 19, 2019): 1–13. http://dx.doi.org/10.1155/2019/8728245.

Повний текст джерела

Анотація:

Graph is an important complex network model to describe the relationship among various entities in real applications, including knowledge graph, social network, and traffic network. Shortest path query is an important problem over graphs and has been well studied. This paper studies a special case of the shortest path problem to find the shortest path passing through a set of vertices specified by user, which is NP-hard. Most existing methods calculate all permutations for given vertices and then find the shortest one from these permutations. However, the computational cost is extremely expens

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Zhang, Junhua, Wentao Li, Long Yuan, Lu Qin, Ying Zhang, and Lijun Chang. "Shortest-path queries on complex networks." Proceedings of the VLDB Endowment 15, no. 11 (2022): 2640–52. http://dx.doi.org/10.14778/3551793.3551820.

Повний текст джерела

Анотація:

The shortest-path query, which returns the shortest path between two vertices, is a basic operation on complex networks and has numerous applications. To handle shortest-path queries, one option is to use traversal-based methods (e.g., breadth-first search); another option is to use extension-based methods, i.e., extending existing methods that use indexes to handle shortest-distance queries to support shortest-path queries. These two types of methods make different trade-offs in query time and space cost, but comprehensive studies of their performance on real-world graphs are lacking. Moreove

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Sidorov, Konstantin, Gonçalo Homem de Almeida Correia, Mathijs De Weerdt, and Emir Demirović. "Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 18 (2024): 20794–802. http://dx.doi.org/10.1609/aaai.v38i18.30068.

Повний текст джерела

Анотація:

People want to rely on optimization algorithms for complex decisions but verifying the optimality of the solutions can then become a valid concern, particularly for critical decisions taken by non-experts in optimization. One example is the shortest-path problem on a network, occurring in many contexts from transportation to logistics to telecommunications. While the standard shortest-path problem is both solvable in polynomial time and certifiable by duality, introducing side constraints makes solving and certifying the solutions much harder. We propose a proof system for constrained shortest

Стилі APA, Harvard, Vancouver, ISO та ін.

41

A. Alkathmawee, Ahmed, Lusong Feng, and Imad S. Alshawi. "Prolonging the Lifetime of Wireless Sensor Networks using LPA-star Search Algorithm." Indonesian Journal of Electrical Engineering and Computer Science 1, no. 2 (2016): 390. http://dx.doi.org/10.11591/ijeecs.v1.i2.pp390-398.

Повний текст джерела

Анотація:

<p>Since sensors have limited power resources, energy consumption has become a critical challenge to Wireless Sensor Networks (WSNs). Most of the routing protocols proposed to transmit data packets through paths which consume low energy aim simply to reduce battery power consumption. This can lead to lead to network partition and reduce network lifetime.Therefore, to balance energy consumption and extend network lifetime while minimizing packet delivery delay; this paper proposes a new energy-routing protocol using the lifelong planning A-star (LPA-star) search algorithm. This algorithm

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Agafonov, Anton, and Vladislav Myasnikov. "Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions." SPIIRAS Proceedings 18, no. 3 (2019): 558–82. http://dx.doi.org/10.15622/sp.2019.18.3.557-581.

Повний текст джерела

Анотація:

An increase in the number of vehicles, especially in large cities, and inability of the existing road infrastructure to distribute transport flows, leads to a higher congestion level in transport networks. This problem makes the solution to navigational problems more and more important. Despite the popularity of these tasks, many existing commercial systems find a route in deterministic networks, not taking into account the time-dependent and stochastic properties of traffic flows, i.e. travel time of road links is considered as constant. This paper addresses the reliable routing problem in st

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Grabusts, Pēteris, and Jurijs Musatovs. "SHORTEST PATH DETERMINATION BETWEEN EDUCATIONAL INSTITUTIONS OF RĒZEKNE MUNICIPALITY." SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference 3 (May 26, 2017): 451. http://dx.doi.org/10.17770/sie2017vol3.2386.

Повний текст джерела

Анотація:

This study describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used in various combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. In this study the application of the Simulated Annealing method to a well - known task of combinatorial analysis, Travelling Salesman Problem, is demonstrated and an experiment aimed to find the shortest tour distances between educational institutions of Rēzekn

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Santoso, Bagus Jati, Ibrahim Tamtama Adi, and Royyana Muslim Ijtihadie. "A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes." Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI) 14, no. 2 (2025): 213–24. https://doi.org/10.23887/janapati.v14i2.95815.

Повний текст джерела

Анотація:

The top-k shortest path problem is a fundamental topic in graph theory and pathfinding applications. Traditional approaches focus solely on finding k paths with the least total cost or distance, often resulting in highly similar paths that offer limited flexibility for user selection. Moreover, real-world navigation demands often involve additional user preferences, such as specific points of interest or required amenities along the route. Motivated by this observation, this paper proposes an efficient framework for answering top-k diverse path search queries incorporating user-specified tag p

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Nazarevych, Valerii, Artem Mykytiuk, Olha Shevchuk, and Ihor Kulyk. "A method of secure network traffic routing based on specified criterias." Collection "Information Technology and Security" 11, no. 2 (2023): 156–65. http://dx.doi.org/10.20535/2411-1031.2023.11.2.293752.

Повний текст джерела

Анотація:

Due to the implementation of new network services, the increase amount of data that need to be transmitted, and the use of networks in various sectors with diverse communication requirements, there is a need to develop new approaches to ensure the quality of such communications. Leading network equipment manufacturers and standardization organizations are developing new routing algorithms, resulting in the introduction of new routing protocols or improvements to existing ones. However, all these algorithms cover routing principles for general-purpose networks and do not consider the communicat

Стилі APA, Harvard, Vancouver, ISO та ін.

46

ZHAO, GENG, KEFENG XUAN, DAVID TANIAR, and BALA SRINIVASAN. "INCREMENTAL K-NEAREST-NEIGHBOR SEARCH ON ROAD NETWORKS." Journal of Interconnection Networks 09, no. 04 (2008): 455–70. http://dx.doi.org/10.1142/s0219265908002382.

Повний текст джерела

Анотація:

Most query search on road networks is either to find objects within a certain range (range search) or to find K nearest neighbors (KNN) on the actual road network map. In this paper, we propose a novel query, that is, incremental k nearest neighbor (iKNN). iKNN can be defined as given a set of candidate interest objects, a query point and the number of objects k, find a path which starts at the query point, goes through k interest objects and the distance of this path is the shortest among all possible paths. This is a new type of query, which can be used when we want to visit k interest objec

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Raut, Prasanta Kumar, Siva Prasad Behera, Said Broumi, and Amarendra Baral. "Evaluation of Shortest Path by using Breadth-First Algorithm under Neutrosophic Environment." HyperSoft Set Methods in Engineering 1 (January 17, 2024): 34–45. http://dx.doi.org/10.61356/j.hsse.2024.18350.

Повний текст джерела

Анотація:

This paper recommends and designs concepts for evaluating the shortest path (SP) for a connected network using a modified breadth-first search algorithm in an uncertain environment. Evaluating the SPs of a network is an essential and extensively encountered optimization problem. Here we develop a new method for determining the SP in a neutrosophic environment in which the arc lengths are uncertain. Here, we use the parameters as neutrosophic numbers, and the new methodology, i.e., canonical representation of neutrosophic numbers in a neutrosophic environment, is used to convert neutrosophic ed

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Khajynova, N. V., M. P. Revotjuk, and L. Y. Shilin. "Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks." Doklady BGUIR 18, no. 5 (2020): 71–79. http://dx.doi.org/10.35596/1729-7648-2020-18-5-71-79.

Повний текст джерела

Анотація:

The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are received by autonomous coordinated transport agents with centralized or collective control. A characteristic feature of transport operations is the independence and asynchrony of the emergence of perturbations of optimal solutions, as well as the lack of global influence of individual perturbations on the set of all processes on the network. This clearly

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Karthick, S., P. Vijay Shankar, T. Jayakumar, G. Merlin Suba, Munleef Quadir, and A. Thomas Paul Roy. "A Novel Approach for Integrated Shortest Path Finding Algorithm (ISPSA) Using Mesh Topologies and Networks-on-Chip (NOC)." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 2s (2023): 87–95. http://dx.doi.org/10.17762/ijritcc.v11i2s.6032.

Повний текст джерела

Анотація:

A novel data dispatching or communication technique based on circulating networks of any network IP is suggested for multi data transmission in multiprocessor systems using Networks-On-Chip (NoC). In wireless communication network management have some negatives have heavy data losses and traffic of data sending data while packet scheduling and low performance in the varied network due to workloads. To overcome the drawbacks, in this method proposed system is Integrated Shortest Path Search Algorithm (ISPSA) using mesh topologies. The message is sent to IP (Internet Protocol) in the network unt

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Liu, Xian Chao, Jian Wen Ren, and Wei Dong Qu. "A Fast Search Algorithm for Transmission Section Based on K Shortest Paths." Advanced Materials Research 960-961 (June 2014): 786–89. http://dx.doi.org/10.4028/www.scientific.net/amr.960-961.786.

Повний текст джерела

Анотація:

A new algorithm based on K shortest paths is presented for quick search of the transmission section, and then the timely electricity network topology is transferred into a directed graph. Using this new algorithm, k shortest paths would be directly searched for; the transmission section influenced greatly by the power flow shift is then obtained quickly. To avoid leaving part of the search because criteria are too small tributary drain election when using a single path to ensure the integrity of the transmission section. Finally CEPRI36 nodes system simulation is analyzed, and the effectivenes

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!