Dimensionality reduction in multiobjective shortest path search

DOI10.1016/J.COR.2015.05.007zbMATH Open1349.90742OpenAlexW640136309MaRDI QIDQ342069FDOQ342069

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

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

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)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• 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
• A comparison of distance metrics for the multi-objective pathfinding problem
• Targeted multiobjective Dijkstra algorithm

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)