Dimensionality reduction in multiobjective shortest path search

DOI10.1016/J.COR.2015.05.007MaRDI QIDQ342069zbMATH OpenOpenAlexFDO

Authors Lawrence Mandow, José Luis Pérez de la Cruz, Francisco-Javier Pulido

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2015.05.007

zbMATH Keywords

combinatorial optimizationlower boundsmultiobjective shortest path problemexact label-setting algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Multiobjective shortest path problems with lexicographic goal-based preferences
• scientific article; zbMATH DE number 4045171
• Multiobjective Heuristic Search in AND/OR Graphs
• An improved multiobjective shortest path algorithm
• Lower bound sets for biobjective shortest path problems

Cites work

• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• scientific article; zbMATH DE number 1783874 (Why is no real title available?)
• A bicriterion approach for routing problems in multimedia networks
• A case of pathology in multiobjective heuristic search
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• A comparison of solution strategies for biobjective shortest path problems
• A label correcting approach for solving bicriterion shortest-path problems
• A multicriteria Pareto-optimal path algorithm
• An aggregate label setting policy for the multi-objective shortest path problem
• An empirical investigation of some bicriterion shortest path algorithms
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Label correcting methods to solve multicriteria shortest path problems
• Multi-objective vehicle routing problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Multiobjective A*
• Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
• On a multicriteria shortest path problem
• On finding dissimilar Pareto-optimal paths
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• The bi-objective covering tour problem

Cited in

(7)

• scientific article; zbMATH DE number 6263560 (Why is no real title available?)
• Enhanced methods for the weight constrained shortest path problem
• Dimensionality reduction in multiobjective optimization: the minimum objective subset problem
• A generalized shortest path tour problem with time windows
• Simple and efficient bi-objective search algorithms via fast dominance checks
• Targeted multiobjective Dijkstra algorithm
• A comparison of distance metrics for the multi-objective pathfinding problem

This page was built for publication: Dimensionality reduction in multiobjective shortest path search

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