A comparison of heuristic best-first algorithms for bicriterion shortest path problems
type: Item
instance of: scholarly article
title: A comparison of heuristic best-first algorithms for bicriterion shortest path problems
zbMATH Open document ID: 1244.90211
author: Lawrence Mandow
author: A. Ruiz-Sepulveda
author: E. Machuca
author: José Luis Pérez de la Cruz
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6066759
zbMATH Keywords: search theory
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: multiobjective shortest path problem
zbMATH Keywords: best-first search
zbMATH Keywords: heuristic search
zbMATH Keywords: artificial intelligence
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.08.030
OpenAlex ID: W2001308858
cites work: An empirical investigation of some bicriterion shortest path algorithms
cites work: A bicriterion approach for routing problems in multimedia networks
cites work: Generalized best-first search strategies and the optimality of A*
cites work: A note on two problems in connexion with graphs
cites work: Q3888874
cites work: An aggregate label setting policy for the multi-objective shortest path problem
cites work: Multi-objective vehicle routing problems
cites work: Multiobjective A * search with consistent heuristics
cites work: A parametric approach to solving bicriterion shortest path problems
cites work: On the cardinality of the Pareto set in bicriteria shortest path problems
cites work: Q4495163
cites work: A comparison of solution strategies for biobjective shortest path problems
cites work: Multiobjective A*
cites work: Q3202146
cites work: A multicriteria Pareto-optimal path algorithm
cites work: An extension of labeling techniques for finding shortest path trees
DOI: 10.1016/J.EJOR.2011.08.030
Recommended article: An empirical investigation of some bicriterion shortest path algorithms
Recommended article: Efficient solution generation for the bicriterion shortest path problems
Recommended article: A parametric approach to solving bicriterion shortest path problems
Recommended article: Heuristics for the bi-objective path dissimilarity problem
Recommended article: Q4546246
Recommended article: Algorithms for time-dependent bicriteria shortest path problems
Recommended article: A heuristic approach to hard constrained shortest path problems
Recommended article: A comparison of solution strategies for biobjective shortest path problems
Recommended article: Q3202146
Recommended article: Heuristics for biquadratic assignment problems and their computational comparison
description: scientific article; zbMATH DE number 6066759