BibTex

Heuristics in best-first algorithms for Multiobjective Shortest Path Problems

Enrique Machuca.
Heuristics in best-first algorithms for multiobjective shortest path problems.
In XIII Conference of the Spanish Association for Artificial intelligence (CAEPIA'09), pages 5-8. 2009.

Abstract

The multiobjective shortest path (MSP) problem is the natural extension of the single-objective shortest path problem. MSP problems usually have not a single optimal solution but a set of efficient solutions. Computational requirements make the development of more efficient multiobjective algorithms in an interesting research topic. This paper analyses previous works, and suggests some lines where improvement can be made using heuristics.

BibTex

@incollection{MAC:2009:D,
  affiliation={Dpto. Lenguajes y Ciencias de la Computaci{\'o}n, Universidad de M{\'a}laga, 29071 M{\'a}laga, Spain},
  url={http: //www.lcc.uma.es:8080/repository/fileDownloader?rfname = cddc5187-6c25-43ad-b634-d01d543a165d.pdf},
  author={Machuca, Enrique},
  title={Heuristics in best-first algorithms for Multiobjective Shortest Path Problems},
  booktitle={XIII Conference of the Spanish Association for Artificial intelligence (CAEPIA'09)},
  year={2009},
  pages={5--8},
}
Redmine Appliance - Powered by TurnKey Linux