Skip to main content
SpringerLink
Log in

Path recovery in frontier search for multiobjective shortest path problems

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alechina N., Logan B. (2001) State space search with prioritised soft constraints. Applied Intelligence 14(3): 263–278

    Article  Google Scholar 

  • Dijkstra E.W. (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271

    Article  Google Scholar 

  • Hansen, P. (1979). Bicriterion path problems. In Lecture Notes in Economics and Mathematical Systems, Vol. 177 (pp. 109–127). Springer.

  • Hart P., Nilsson N., Raphael B. (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4 2: 100–107

    Article  Google Scholar 

  • Korf, R. E. (1985). Iterative-deepening A*: An optimal admissible tree search. In Proceedings of the IX International Joint Conference on Artificial Intelligence (IJCAI’85), pp. 1034–1036.

  • Korf, R. E. (1999). Divide-and-conquer bidirectional search: First results. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI’99), pp. 1184–1189.

  • Korf R., Zhang W., Thayer I., Hohwald H. (2005) Frontier search. Journal of the Association for Computing Machinery 2(5): 715–748

    Google Scholar 

  • Mandow, L., & Pérez de la Cruz, J. L. (2005). A new approach to multiobjective A* search. In Proceedings of the XIX International Joint Conference on Artificial Intelligence (IJCAI’05), pp. 218–223.

  • Mandow, L., & Pérez de la Cruz, J. L. (2006). Comparison of heuristics in multiobjective A* search. In CAEPIA 2005, Lecture Notes in Artificial Intelligence, Vol. 4177 (pp. 180–189). Springer.

  • Mandow, L., & Pérez de la Cruz, J. L. (2007). A multiobjective frontier search algorithm. In Proceedings of the XX International Joint Conference on Artificial Intelligence (IJCAI’07), pp. 2340–2345.

  • Refanidis I., Vlahavas I. (2003) Multiobjective heuristic state-space search. Artificial Intelligence 145: 1–32

    Article  Google Scholar 

  • Stewart B.S., White C.C. (1991) Multiobjective A*. Journal of the Association for Computing Machinery 38(4): 775–814

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, 29071, Malaga, Spain

    L. Mandow & J. L. Pérez de la Cruz

Authors
  1. L. Mandow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. L. Pérez de la Cruz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Mandow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mandow, L., Pérez de la Cruz, J.L. Path recovery in frontier search for multiobjective shortest path problems. J Intell Manuf 21, 89–99 (2010). https://doi.org/10.1007/s10845-008-0169-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-008-0169-2

Keywords

Search

Navigation