Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing

Annals of Operations Research

Volumn 75, Issue , 1997, Pages 189-208

  Sadeh, Norman M ^a   Nakakuki, Yoichiro ^c   Thangiah, Sam R ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SLIPPERY ROCK UNIVERSITY   (United States)

^c NONE

Author keywords

Learning; Scheduling; Simulated annealing; Vehicle routing

Indexed keywords

EID: 0031316615     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018907412789     Document Type: Article

References (36)

1. W.H. Beyer, CRC Standard Mathematical Tables, 28th ed., CRC Press, Boca Raton, FL, 1987.
2. L. Bodin, B.L. Golden, A.A. Assad and M. Ball, The state of the art in the routing and scheduling of vehicles and crews, Computers and Operations Research 10(1983).
3. V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Opt. Theory Appl. 45(1985)41-51.
4. W.C. Chian and R. Russell, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Working Paper, Department of Quantitative Methods, University of Tulsa, Tulsa, OK 74104, 1993.
5. M. Desrochers, J. Desrosiers and M.M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40(1992).
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
7. F. Glover and M. Laguna, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, June 1992.
8. B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
9. S.C. Graves, A review of production scheduling, Operations Research 29(1981)646-675.
10. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: Experimental evaluation; Part I: Graph partitioning, Operations Research 37(1989)865-892.
11. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: Experimental evaluation; Part II: Graph coloring and number partitioning, Operations Research 39(1991)378-406.
12. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983)671-680.
13. G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59(1992)345-358.
14. H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the general jobshop scheduling problem, Technical Report, Department of Management, The University of Texas at Austin Austin, TX, Working Paper, 1988.
15. T.E. Morton and D.W. Pentico, Heuristic Scheduling Systems, Wiley Series in Engineering and Technology Management, 1993.
16. T.E. Morton, SCHED-STAR: A price-based shop scheduling module, Journal of Manufacturing and Operations Management (1988)131-181.
17. Y. Nakakuki and N. Sadeh, Increasing the efficiency of simulated annealing search by learning to recognize (un)promising runs, Proceedings of the 12th National Conference on Artificial Intelligence, 1994, pp. 1316-1322.
18. I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, OMEGA Int. J. of Mgmt. Sci. 17(1989)551-557.
19. I.H. Osman, Meta-strategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research 41(1993)421-451.
20. A. Palay, Searching with probabilities, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, July 1983.
21. J.Y. Potvin and S. Bengio, A genetic approach to the vehicle routing problem with time windows, Technical Report CRT-953, Centre de Recherche sur les Transports, Université de Montréal, Canada, 1993.
22. J.Y. Potvin and J.M. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research 66(1993)331-340.
23. Y. Rochat and E.D. Taillard, Probabilisitic diversification and intensification in local search for vehicle routing, European Journal of Operational Research 66(1995)331-340.
24. N. Sadeh, Look-ahead techniques for micro-opportunistic job shop scheduling, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, March 1991.
25. N. Sadeh, Micro-opportunistic scheduling: The micro-boss factory scheduler, in: Intelligent Scheduling, Zweben and Fox, eds., Morgan Kaufmann Publishers, 1994.
26. N. Sadeh and Y. Nakakuki, Focused simulated annealing search: An application to job shop scheduling, Annals of Operations Research 60; also available as Technical Report CMU-RI-TR-94- 30, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213, 1994.
27. N. Sadeh and Y. Nakakuki, Focused simulated annealing search: An application to job shop scheduling, Annals of Operations Research 60; also available as Technical Report CMU-RI-TR-94-30, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA 15213, 1994.
28. M.W.P. Savelsbergh, Local search for routing problems with time windows, Annals of Operations Research 4(1985)285-305.
29. M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research 35(1987)254-265.
30. S.R. Thangiah, Vehicle routing with time windows using genetic algorithms, in: Application Handbook of Genetic Algorithms: New Frontiers, CRC Press, 1994.
31. S.R. Thangiah, I.H. Osman and T. Sun, Metaheuristics for vehicle routing problems with time windows, Technical Report, Artificial Intelligence and Robotics Laboratory, Computer Science Department, Slippery Rock University, Slippery Rock, PA 16057, 1994.
32. P.J. Van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Operations Research 40(1992)113-125.
33. A.P.J. Vepsalainen and T.E. Morton, Priority rules for job shops with weighted tardiness costs, Management Science 33(1987)1035-1047.
34. C.J.C.M. Watkins, Learning with delayed rewards, Ph.D. Thesis, Cambridge University, Psychology Department, 1989.
35. E.H. Wefald and S.J. Russel, Adaptive learning of decision-theoretic search control knowledge, 6th International Workshop on Machine Learning, Ithaca, NY, 1989.
36. M. Zweben, E. Davis, B. Daun and M. Deale, Rescheduling with iterative repair, Technical Report FIA-92-15, NASA Ames Research Center, Artificial Intelligence Research Branch, Moffett Field, CA 94025, April 1992.