Anytime Pack Heuristic Search

  • Satya Gautam Vadlamudi
  • Sandip Aine
  • Partha Pratim Chakrabarti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8251)


Heuristic search is a fundamental problem solving technique in artificial intelligence. In this paper, we propose an anytime heuristic search algorithm called Anytime Pack Search (APS) which helps in solving hard combinatorial search problems efficiently. It expands nodes of a search graph in a localized best-first manner so as to converge towards good quality solutions at regular intervals. APS is complete on bounded graphs and guarantees termination with an optimal solution. Experimental results on the sliding-tile puzzle problem, the traveling salesman problem, and the single-machine scheduling problem show that APS significantly outperforms some of the state-of-the-art anytime algorithms.


problem solving heuristic search anytime algorithms 


  1. 1.
    Aine, S., Chakrabarti, P.P., Kumar, R.: AWA* - A window constrained anytime heuristic search algorithm. In: Veloso, M.M. (ed.) IJCAI, pp. 2250–2255 (2007)Google Scholar
  2. 2.
    Chakrabarti, P.P., Aine, S.: New approaches to design and control of time limited search algorithms. In: Chaudhury, S., Mitra, S., Murthy, C.A., Sastry, P.S., Pal, S.K. (eds.) PReMI 2009. LNCS, vol. 5909, pp. 1–6. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)CrossRefGoogle Scholar
  4. 4.
    Korf, R.E., Felner, A.: Disjoint pattern database heuristics. Artif. Intell. 134(1-2), 9–22 (2002)CrossRefzbMATHGoogle Scholar
  5. 5.
    Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operational Research 14(4), 699–719 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Li, G.: Single machine earliness and tardiness scheduling. European Journal of Operational Research 96(3), 546–558 (1997)CrossRefzbMATHGoogle Scholar
  7. 7.
    Lowerre, B.: The Harpy Speech Recognition System. PhD thesis, Carnegie Mellon University (1976)Google Scholar
  8. 8.
    Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 376–384 (1991)CrossRefzbMATHGoogle Scholar
  9. 9.
    van den Berg, J., Shah, R., Huang, A., Goldberg, K.Y.: Anytime nonparametric A*. In: AAAI, pp. 105–111 (2011)Google Scholar
  10. 10.
    Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), Monterey, CA, pp. 90–98 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Satya Gautam Vadlamudi
    • 1
  • Sandip Aine
    • 2
  • Partha Pratim Chakrabarti
    • 1
  1. 1.Indian Institute of Technology KharagpurKharagpurIndia
  2. 2.Indraprastha Institute of Information TechnologyNew DelhiIndia

Personalised recommendations