Quantum Algorithm for Shortest Path Search in Directed Acyclic Graph

2019 ◽  
Vol 43 (1) ◽  
pp. 47-51
Author(s):  
K. R. Khadiev ◽  
L. I. Safina
Keyword(s):  
Shortest Path ◽  
Directed Acyclic Graph ◽  
Quantum Algorithm ◽  
Acyclic Graph ◽  
Path Search ◽  
Shortest Path Search

Efficient Shortest Path Search in Large Road Network Environment: A Heuristic Approach

2011 ◽  
Vol 57 (6) ◽  
pp. 530
Author(s):  
Sung-Hyun Shin ◽  
Sang-Wook Kim ◽  
Junghoon Lee ◽  
Sang-Chul Lee ◽  
EulGyu Im
Keyword(s):  
Shortest Path ◽  
Road Network ◽  
Heuristic Approach ◽  
Network Environment ◽  
Path Search ◽  
Shortest Path Search

The weighted shortest path search based on multi-agents in mobile GIS management services

2010 ◽  
Vol 12 (4) ◽  
pp. 302-317
Author(s):  
Min Peng ◽  
Naixue Xiong ◽  
Jong Hyuk Park ◽  
Athanasios V. Vasilakos ◽  
Jiawen Zhang
Keyword(s):  
Shortest Path ◽  
Mobile Gis ◽  
Path Search ◽  
Shortest Path Search ◽  
Multi Agents ◽  
Management Services

scholarly journals Optimization of modes of the electric power systems by genetic algorithms

2020 ◽  
Vol 216 ◽  
pp. 01099
Author(s):  
Behzod Pulatov ◽  
Shanazarov Alisher
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Power Systems ◽  
Electric Power ◽  
Shortest Path ◽  
Optimization Problems ◽  
Electric Power Systems ◽  
Data Filtering ◽  
Path Search ◽  
Shortest Path Search

In article discusses issues for solving optimization problems based on the use of genetic algorithms. Nowadays, the genetic algorithms for solving various problems. This includes the shortest path search, approximation, data filtering and others. In particular, data is being examined regarding the use of a genetic algorithm to solve problems of optimizing the modes of electric power systems. Imagine an algorithm for developing the development of mathematical models, which includes developing the structure of the chromosome, creating a started population, creating a directing force for the population, etc.

scholarly journals Shortest path search in road network with incomplete information

2011 ◽  
Vol 31 (3) ◽  
pp. 651-653 ◽  
Author(s):  
Ke-jun LONG ◽  
Lee D HAN ◽  
Sai-zheng WANG
Keyword(s):  
Incomplete Information ◽  
Shortest Path ◽  
Road Network ◽  
Path Search ◽  
Shortest Path Search

Accelerating Traffic Assignment with Customizable Contraction Hierarchies

2020 ◽  
Vol 2674 (1) ◽  
pp. 188-196 ◽  
Author(s):  
Arne Schneck ◽  
Klaus Nökel
Keyword(s):  
Shortest Path ◽  
Traffic Assignment ◽  
Shortest Path Problem ◽  
Transport Modeling ◽  
The Past ◽  
Acceleration Techniques ◽  
Network Loading ◽  
Enormous Amount ◽  
Path Search ◽  
Shortest Path Search

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-conjugate Frank–Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra’s algorithm.

Sign in / Sign up

Export Citation Format

Share Document