BibTex

Path recovery in frontier search for multiobjective shortest path problems

Lawrence Mandow and J.L. Pérez de la Cruz.
Path recovery in frontier search for multiobjective shortest path problems.
Journal of Intelligent Manufacturing, 21:89-99, 2010. 10.1007/s10845-008-0169-2.

Abstract

Frontier search is a best-first graph search technique that allows significant memory savings over previous best-first algorithms. The fundamental idea is to remove from memory already explored nodes, keeping only open nodes in the search frontier. However, once the goal node is reached, additional techniques are needed to recover the solution path. This paper describes and analyzes a path recovery procedure for frontier search applied to multiobjective shortest path problems. Differences with the scalar case are outlined, and performance is evaluated over a random problem set.

BibTex

@article{Mandow:2010:R,
  affiliation={Universidad de M{\'a}laga Dpto. Lenguajes y Ciencias de Computaci ón, ETSI Inform{\'a}tica 29071 M{\'a}laga Spain},
  journal={Journal of Intelligent Manufacturing},
  url={http: //dx.doi.org/10.1007/s10845-008-0169-2},
  author={Mandow, Lawrence and P{\'e}rez de la Cruz, J.L.},
  title={Path recovery in frontier search for multiobjective shortest path problems},
  volume={21},
  publisher={Springer and Economics},
  year={2010},
  pages={89--99},
  note={10.1007/s10845-008-0169-2},
}
Redmine Appliance - Powered by TurnKey Linux