BibTex

An evaluation of heuristic functions for bicriterion shortest path problems

Enrique Machuca, Lawrence Mandow, and J.L. Pérez De La Cruz.
An evaluation of heuristic functions for bicriterion shortest path problems.
Citeseer, 2009.

Abstract

Abstract. The paper considers a set of heuristic search algorithms for the Bicriterion Shortest Path Problem. These are presented as particular cases of a more general algorithm. Their performance is evaluated over a random problem set using two general heuristic functions proposed by Tung & Chew (1992). The experimental results show that the heuristics reduce the space requirements of the algorithms considered. One contribution of this paper is to show that, contrary to intuition, no improvement in time performance is achieved in these cases by using heuristics. In fact, one of the heuristics appears to work against time efficiency. The paper provides also an explanation to the observed phenomena and points out possible lines of improvement.

BibTex

@inbook{MAC:2009:C,
  url={http: //citeseerx.ist.psu.edu/viewdoc/download?doi = 10.1.1.160.4715&rep = rep1 &type = pdf},
  author={Machuca, Enrique and Mandow, Lawrence and P{\'e}rez De La Cruz, J.L.},
  title={An evaluation of heuristic functions for bicriterion shortest path problems},
  booktitle={New Trends in Artificial Intelligence Proceedings of the XIV Portuguese Conference on Artificial Intelligence EPIA 2009 Universidade de Aveiro Portugal},
  publisher={Citeseer},
  year={2009},
}
Redmine Appliance - Powered by TurnKey Linux