TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path [PDF]
, 2021 The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur +2 more
core +1 more source
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The shortest path problem has been studied to be solved through diverse deterministic and also stochastic approaches such as Ant Colony Optimization. One of the most challenging issues with the implication of Ant Colony Optimization to solve the shortest
N. Zarrinpanjeh +5 more
doaj +1 more source
Study on single-valued neutrosophic graph with application in shortest path problem
CAAI Transactions on Intelligence Technology, 2020 Fuzzy set and neutrosophic set are two efficient tools to handle the uncertainties and vagueness of any real-world problems. Neutrosophic set is more useful than fuzzy set (intuitionistic fuzzy sets) to manage the uncertainties of a real-life problem ...
Ruxiang Liu
doaj +1 more source
Faster algorithms for shortest path and network flow based on graph decomposition
Journal of Graph Algorithms and Applications, 2019 We propose faster algorithms for the maximum flow problem and shortest path problems based on graph decomposition. Our algorithms first construct indices (data structures) from a given graph, then use them for solving the problems.
Manas Jyoti Kashyop +2 more
doaj +1 more source
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +1 more source
Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space
Journal of Advanced Transportation, 2022 Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path
Hongtai Yang +5 more
doaj +1 more source
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks [PDF]
, 2009 This article is posted here with permission from the IEEE - Copyright @ 2009 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic ...
Yang, S +5 more
core +1 more source
A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems [PDF]
Neutrosophic Sets and Systems, 2019 Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely ...
Ranjan Kumar +5 more
doaj +1 more source
Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks [PDF]
, 2010 Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc ...
Yang, S +5 more
core +1 more source