An Adaptive Framework for Solving Multiple Hard Problems Under Time Constraints

  • Sandip Aine
  • Rajeev Kumar
  • P. P. Chakrabarti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3801)


We address the problem of building an integrated meta-level framework for time deliberation and parameter control for a system solving a set of hard problems. The trade-off is between the solution qualities achieved for individual problems and the global outcome under the given time-quality constraints. Each problem is modeled as an anytime optimization algorithm whose quality-time performance varies with different control parameter settings. We use the proposed meta-level strategy for generating a deliberation schedule and adaptive cooling mechanism for anytime simulated annealing (ASA) solving hard task sets. Results on task sets comprising of the traveling salesman problem (TSP) instances demonstrate the efficacy of the proposed control strategies.


Travel Salesman Problem Travel Salesman Problem Time Allocation Preemptive Schedule Adaptive Framework 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boddy, M., Dean, T.: Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67, 245–285 (1994)zbMATHCrossRefGoogle Scholar
  2. 2.
    Dean, T., Boddy, M.: An analysis of time-dependent planning. In: Proceedings of 6th National Conference on Artificial Intelligence (AAAI 1988), St. Paul, MN, pp. 49–54. AAAI Press, Menlo Park (1988)Google Scholar
  3. 3.
    Horvitz, E.J.: Computation and action under bounded resources. PhD thesis, Stanford University (1990)Google Scholar
  4. 4.
    Hansen, E.A., Zilberstein, S.: Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence 126, 139–157 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Likhachev, M., Gordon, G.J., Thrun, S.: Ara*: Anytime A* with provable bounds on sub-optimality. In: Advances in Neural Information Processing Systems, vol. 16. MIT Press, Cambridge (2004)Google Scholar
  6. 6.
    van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. Kluwer, Dordrecht (1992)Google Scholar
  7. 7.
    Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3, 124–141 (1999)CrossRefGoogle Scholar
  8. 8.
    Bertsekas, D.P.: Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Englewood Cliffs (1987)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sandip Aine
    • 1
  • Rajeev Kumar
    • 1
  • P. P. Chakrabarti
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology KharagpurKharagpurIndia

Personalised recommendations