A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Publication:439323
DOI10.1016/j.ejor.2011.08.030zbMath1244.90211MaRDI 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
combinatorial optimization; artificial intelligence; heuristic search; search theory; multiobjective shortest path problem; best-first search
90C35: Programming involving graphs or networks
68W40: Analysis of algorithms
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
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