Multiobjective shortest path problems with lexicographic goal-based preferences

DOI10.1016/J.EJOR.2014.05.008MaRDI QIDQ297067zbMATH OpenOpenAlexFDO

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

Publication date 24 June 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.05.008

zbMATH Keywords

combinatorial optimizationheuristic searchgoal programminglabel-setting searchmultiobjective shortest path problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• An improved multiobjective shortest path algorithm
• A multi-objective shortest path problem
• An aggregate label setting policy for the multi-objective shortest path problem
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• Speeding up Martins' algorithm for multiple objective shortest path problems

Cites work

• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 47228 (Why is no real title available?)
• scientific article; zbMATH DE number 1386739 (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 multicriteria Pareto-optimal path algorithm
• A review of goal programming and its applications
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Multi-objective vehicle routing problems
• Multiobjective A*
• Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
• On a multicriteria shortest path problem
• On the cardinality of the Pareto set in bicriteria shortest path problems

Cited in

(8)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
• Lower bound sets for biobjective shortest path problems
• Dimensionality reduction in multiobjective shortest path search
• An aggregate label setting policy for the multi-objective shortest path problem
• Hierarchical multiobjective shortest path problems
• Targeted multiobjective Dijkstra algorithm
• An improved multiobjective shortest path algorithm

This page was built for publication: Multiobjective shortest path problems with lexicographic goal-based preferences

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