Ranking One Million Simple Paths in Road Networks

DOI10.1142/S0217595916500421MaRDI QIDQ5506763zbMATH OpenOpenAlexFDO

Authors Antonio Sedeño-Noda

Publication date 16 December 2016

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595916500421

zbMATH Keywords

best solutionscombinatorial optimizationshortest path algorithms

Mathematics Subject Classification ID

Distance in graphs (05C12) Deterministic network models in operations research (90B10)

Recommendations

• Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
• An algorithm for ranking quickest simple paths
• The shortest path problem on large-scale real-road networks
• Fast paths in large-scale dynamic road networks
• Shortest path calculation in large road networks
• scientific article; zbMATH DE number 3880462
• Road network reconstruction for organizing paths
• Nearest neighbor query in road networks

Cites work

• A Method for the Solution of the N th Best Path Problem
• A new implementation of Yen's ranking loopless paths algorithm
• A note on two problems in connexion with graphs
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• An efficient algorithm for K shortest simple paths
• An efficient time and space K point-to-point shortest simple paths algorithm
• Automata, Languages and Programming
• Enumerating \(K\) best paths in length order in DAGs
• Finding the k shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
• Near-shortest and K-shortest simple paths
• On the \(K\) shortest path trees problem
• Solving k-shortest and constrained shortest path problems efficiently

Cited in

(8)

• Comparing directed and weighted road maps
• Enumerating \(K\) best paths in length order in DAGs
• Solving a constrained economic lot size problem by ranking efficient production policies
• An efficient time and space K point-to-point shortest simple paths algorithm
• On finding subpaths with high demand
• Near-shortest and K-shortest simple paths
• K-shortest simple paths using biobjective path search
• An algorithm for ranking paths that may contain cycles

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Ranking One Million Simple Paths in Road Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506763)