A comparison of heuristic best-first algorithms for bicriterion shortest path problems
AbstractA variety of algorithms have been proposed to solve the bicriterion shortest path problem. This article analyzes and compares the performance of three best-first (label-setting) algorithms that accept heuristic information to improve efficiency. These are NAMOA∗, MOA∗, and Tung & Chew’s algorithm (TC). A set of experiments explores the impact of heuristic information in search efficiency, and the relative performance of the algorithms. The analysis reveals that NAMOA∗ is the best option for difficult problems. Its time performance can benefit considerably from heuristic information, though not in all cases. The performance of TC is similar but somewhat worse. However, the time performance of MOA∗ is found to degrade considerably with the use of heuristic information in most cases. Explanations are provided for these phenomena.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 217 (2012)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Search theory; Combinatorial optimization; Multiobjective shortest path problem; Best-first search; Heuristic search; Artificial intelligence;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mote, John & Murthy, Ishwar & Olson, David L., 1991. "A parametric approach to solving bicriterion shortest path problems," European Journal of Operational Research, Elsevier, vol. 53(1), pages 81-92, July.
- Tung Tung, Chi & Lin Chew, Kim, 1992. "A multicriteria Pareto-optimal path algorithm," European Journal of Operational Research, Elsevier, vol. 62(2), pages 203-209, October.
- Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.
- Iori, Manuel & Martello, Silvano & Pretolani, Daniele, 2010. "An aggregate label setting policy for the multi-objective shortest path problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1489-1496, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.