Speeding up Martins' algorithm for multiple objective shortest path problems

DOI10.1007/s10288-013-0232-5zbMath1292.90266OpenAlexW2075265540MaRDI QIDQ2441362

Pieter Audenaert, Sofie Demeyer, Piet Demeester, Jan Goedgebeur, Mario Pickavet

Publication date: 24 March 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/4410352

zbMATH Keywords

Pareto optimal setmultiobjective shortest path problemlabeling algorithmbidirectional routingstop condition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

An exact method for the biobjective shortest path problem for large-scale road networks ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ An improved multiobjective shortest path algorithm ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Unnamed Item ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Lower bound sets for biobjective shortest path problems ⋮ A biobjective Dijkstra algorithm ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• An algorithm for ranking paths that may contain cycles
• On a multicriteria shortest path problem
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• A comparison of solution strategies for biobjective shortest path problems
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• The tricriterion shortest path problem with at least two bottleneck objective functions
• A bicriterion shortest path algorithm
• An algorithm for the ranking of shortest paths
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• An empirical investigation of some bicriterion shortest path algorithms
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A label correcting approach for solving bicriterion shortest-path problems
• New algorithms for multi objective shortest path problem.
• Heuristic shortest path algorithms for transportation applications: state of the art
• On a routing problem
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Finding the k Shortest Paths
• Multiobjective A*
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Finding the Shortest Route between Two Points in a Network
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: Speeding up Martins' algorithm for multiple objective shortest path problems