BibTex

A Memory-Efficient Search Strategy for Multiobjective Shortest Path Problems

Lawrence Mandow and J.L. Pérez de la Cruz.
A memory-efficient search strategy for multiobjective shortest path problems.
In B. Mertsching, M. Hund, and Z. Aziz, editors, KI 2009: Advances in Artificial Intelligence, volume 5803 of Lecture Notes in Computer Science, pages 25-32. Springer Berlin / Heidelberg, 2009. 10.1007/978-3-642-04617-9_4.

Abstract

The paper develops vector frontier search, a new multiobjective search strategy that achieves an important reduction in space requirements over previous proposals. The complexity of a resulting multiobjective frontier search algorithm is analyzed and its performance is evaluated over a set of random problems.

BibTex

@incollection{Mandow:2009:C,
  affiliation={Universidad de M{\'a}laga Dpto. Lenguajes y Ciencias de la Computaci{\'o}n 29071 M{\'a}laga Spain},
  doi={10.1007/978-3-642-04617-9_4},
  keyword={Computer Science},
  url={http: //dx.doi.org/10.1007/978-3-642-04617-9_4},
  author={Mandow, Lawrence and P{\'e}rez de la Cruz, J.L.},
  title={A Memory-Efficient Search Strategy for Multiobjective Shortest Path Problems},
  editor={B. Mertsching and M. Hund and Z. Aziz},
  booktitle={KI 2009: Advances in Artificial Intelligence},
  series={Lecture Notes in Computer Science},
  volume={5803},
  publisher={Springer Berlin / Heidelberg},
  year={2009},
  pages={25--32},
  note={10.1007/978-3-642-04617-9_4},
}
Redmine Appliance - Powered by TurnKey Linux