A comparison of heuristic best-first algorithms for bicriterion shortest path problems

DOI10.1016/j.ejor.2011.08.030zbMath1244.90211OpenAlexW2001308858MaRDI QIDQ439323

Lawrence Mandow, A. Ruiz-Sepulveda, Enrique Machuca, José-Luis Pérez-de-la-Cruz

Publication date: 16 August 2012

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

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

zbMATH Keywords

combinatorial optimizationartificial intelligenceheuristic searchsearch theorymultiobjective shortest path problembest-first search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Multiobjective shortest path problems with lexicographic goal-based preferences ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Lower bound sets for biobjective shortest path problems ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme ⋮ Shortest paths with a cost constraint: a probabilistic analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An aggregate label setting policy for the multi-objective shortest path problem
• A parametric approach to solving bicriterion shortest path problems
• A comparison of solution strategies for biobjective shortest path problems
• An extension of labeling techniques for finding shortest path trees
• A multicriteria Pareto-optimal path algorithm
• An empirical investigation of some bicriterion shortest path algorithms
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Multi-objective vehicle routing problems
• Multiobjective A ^* search with consistent heuristics
• Generalized best-first search strategies and the optimality of A*
• Multiobjective A*
• A bicriterion approach for routing problems in multimedia networks

This page was built for publication: A comparison of heuristic best-first algorithms for bicriterion shortest path problems