Metaheuristic search concepts: A tutorial with applications to production and logistics

Metaheuristic Search Concepts: A Tutorial with Applications to Production and Logistics

Volumn , Issue , 2010, Pages 1-316

  Zäpfel, Günther ^a   Braune, Roland ^a   Bögl, Michael ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892040401     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-11343-7     Document Type: Book

References (211)

1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. J. Wiley & Sons, Chichester, UK, 1997.
2. E. H. L Aarts and P. J. M van Laarhoven. A new polynomial-time cooling schedule. In Proceedings of the IEEE International Conference on Computer-Aided Design, pages 206- 208, Santa Clara, California, 1985.
3. E. H. L. Aarts and P. J. M van Laarhoven. Statistical cooling: A general approach to combinatorial optimization problems. Philips Journal of Research, 40:193-226, 1985.
4. J. Adams, E. Balas, and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3):391-401, 1988.
5. M. Affenzeller, S. Winkler, S. Wagner, and A. Beham. Genetic Algorithms and Genetic Programming-Modern Concepts and Practical Applications. CRC Press, 2009.
6. R. M. Aiex, S. Binato, and M. G. C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29(4):393-430, 2003.
7. E. Alba, editor. Parallel Metaheuristics: A New Class of Algorithms. John Wiley and Sons, 2005.
8. B. Andresen. Finite-time thermodynamics and simulated annealing. In J. S. Shinov, editor, Entropy and Entropy Generation, pages 111-127. Kluwer, Dordrecht, 1996.
9. B. Andresen and J. M. Gordon. Constant thermodynamic speed for minimizing entropy production in thermodynamic processes and simulated annealing. Physical Review E, 50:4346- 4351, 1994.
10. D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2):149-156, 1991.
11. H. Aytug, K. Kempf, and R. Uzsoy. Measures of subproblem criticality in decomposition algorithms for shop scheduling. International Journal of Production Research, 41(5):865- 882, 2002.
12. K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
13. E. Balas. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17:941-957, 1969.
14. E. Balas and A. Vazacopoulos. Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44(2):262-275, 1998.
15. R. Battiti. Reactive search: Toward self-tuning heuristics. In C. R. Reeves H. Osman and G. D. Smith, editors, Modern Heuristic Search Methods, pages 61-83. Wiley, Chichester, UK, 1996.
16. C. Bierwirth. A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spektrum, 17:87-92, 1995.
17. C. Bierwirth and D. C. Mattfeld. Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1):1-17, 1999. 301.
18. C. Bierwirth, D. C. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In H.M. Voigt et al., editor, Proceedings of Parallel Problem Solving from Nature IV, pages 310-318. Springer Verlag, Berlin, Germany, 1996.
19. S. Binato, W. J. Hery, D. Loewenstern, and M. G. C. Resende. A GRASP for job shop scheduling. In C.C. Ribeiro and P. Hansen, editors, Essays and surveys on metaheuristics, pages 59-79. Kluwer Academic Publishers, 2001.
20. J. H. Blackstone, D. T. Phillips, and G. L. Hogg. A state of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20(1):27-45, 1982.
21. J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz. Handbook on Scheduling. Springer-Verlag Berlin Heidelberg, 2007.
22. J. W. Blazewicz, W. Domschke, and E. Pesch. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 33:1-33, 1996.
23. C. Blum. ACO applied to group shop scheduling: A case study on intensification and diversification. In M. Dorigo, G. DiCaro, and M. Sampels, editors, Proceedings of ANTS 2002-From Ant Colonies to Artificial Ants: Third International Workshop on Ant Algorithms, Lecture Notes in Computer Science 2463, pages 14-27. Springer-Verlag, Berlin, 2002.
24. C. Blum and M. Dorigo. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B, 34(2):1161-1172, 2004.
25. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308, 2003.
26. C. Blum and M. Sampels. An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms, 3(3):285-308, 2004.
27. E. Bonabeau, M. Dorigo, and G. Theraulaz. From Natural to Artificial Swarm Intelligence. Oxford University Press, 1999.
28. A. H. Bond and L. Gasser, editors. Readings in Distributed Artificial Intelligence. Morgan Kaufman Publishers, San Mateo, CA, 1988.
29. N. Boysen, M. Fliedner, and A. Scholl. A classification of assembly line balancing problems. European Journal of Operational Research, 183:674-693, 2007.
30. H. Br̈asel, T. Tautenhahn, and F.Werner. Constructive heuristic algorithms for the open shop problem. Computing, 51:95-110, 1993.
31. R. Braune. Subproblem solving and machine prioritization in the shifting bottleneck procedure for weighted tardiness job shops. In Proceedings of the 20th European Modeling and Simulation Symposium (EMSS2008), pages 27-32, Campora San Giovanni, Italy, September 2008.
32. G. H. Brooks and C. R. White. An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering, 16:34-40, 1965.
33. P. Brucker, A. Drexl, R. M̈ohring, K. Neumann, and E. Pesch. Resource-constrained project scheduling: Notation, classification, models and methods. European Journal of Operational Research, 112(1):3-41, 1999.
34. P. Brucker, B. Jurisch, and B. Sievers. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49:107-127, 1994.
35. A. Roli C. Blum, M. J. Blesa Aguilera and M. Sampels, editors. Hybrid Metaheuristics, volume 114 of Studies in Computational Intelligence. Springer Verlag, 2008.
36. M. F. Cardoso, R. L. Salcedo, and S. F. de Azevedo. Nonequilibrium simulated annealing: A faster approach to combinatorial minimization. Industrial Engineering and Chemical Research, 33:1908-1918, 1994.
37. J. Carlier and E. Pinson. An algorithm for solving the job shop problem. Management Science, 35(2):164-176, 1989.
38. D. C. Carroll. Heuristic sequencing of job with single and multiple components. PhD thesis, Sloan School of Management, MIT, 1965.
39. V. Cerny. Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45:41-51, 1985.
40. J. B. Chambers and J. W. Barnes. New tabu search results for the job shop scheduling problem. Technical report, University of Texas, Austin, 1996. Graduate Program in Operations Research and Industrial Engineering.
41. V. Christos and E. P. K. Tsang. Guided local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, chapter 7, pages 185-218. Kluwer Academic Publishers, 2003.
42. W. Clark. The Gantt Chart: A Working Tool of Management. Ronald, New York, 1922.
43. G. Clarke and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4):568-581, 1964.
44. C. A. Coello Coello. Theroetical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11):1245-1287, 2002.
45. H. Cohn and M. Fielding. Simulated annealing: Searching for an optimal temperature schedule. SIAM Journal on Optimization, 9:779-802, 1999.
46. A. Colorni, M. Dorigo, and V. Maniezzo. Distributed optimization by ant colonies. In Proceedings of the First European Conference on Artificial Life, pages 134-142. Elsevier, 1992.
47. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian. Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34(1):39-53, 1994.
48. G. A. Croes. A method for solving traveling salesman problems. Operations Research, 6:791-812, 1958.
49. G. B. Dantzig and R.H. Ramser. The Truck Dispatching Problem. Management Science, 6:8091, 1959.
50. L. N. de Castro. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. CRC Press Inc., 2006.
51. D. de Werra and A. Hertz. Tabu search techniques: A tutorial and an application to neural networks. OR Spektrum, 11:131-141, 1989.
52. K. Deb. Multi-objective optimization. In Edmund K. Burke and Graham Kendall, editors, Search Methodologies-Introductory Tutorials in Optimization and Decision Support Techniques, chapter 10, pages 273-316. Springer Science + Business Media, Inc., 2005.
53. M. Dell'Amico and M. Trubian. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41:231-252, 1993.
54. E. Demirkol, S. Mehta, and R. Uzsoy. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3(2):111-137, 1997.
55. J.-L. Deneubourg, S. Aron, S. Goss, and J.-M. Pasteels. The self-organizing exploratory pattern of the argentine ant. Journal of Insect Behavior, 3:159-168, 1990.
56. G. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9:317-365, 1998.
57. K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl, and M. Reimann, editors. Metaheuristics-Progress in Complex Optimization. Springer Science + Business Media, 2007.
58. M. Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, IT, 1992.
59. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11-32. McGraw-Hill, 1999.
60. M. Dorigo and L. M. Gambardella. Ant colonies for the traveling salesman problem. BioSystems, 43:73-81, 1997.
61. M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53- 66, 1997.
62. M. Dorigo, V. Maniezzo, and A. Colorni. Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, IT, 1991.
63. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29- 41, 1996.
64. M. Dorigo and T. Sẗutzle. The Ant Colony Optimization metaheuristic: Algorithms, applications, and advances. Technical Report IRIDIA-2000-32, Universite Libre de Bruxelles, 2000.
65. Marco Dorigo, Gianni Di Caro, and Luca M. Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life, 5(3):137-172, 1999.
66. U. Dorndorf and E. Pesch. Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22(1):25-40, 1995.
67. A. Drexl and A. Kimms. Lot sizing and scheduling-survey and extensions. European Journal of Operational Research, 99(2):221-235, 1997.
68. G. Dueck and T. Scheuer. Threshold accepting-a general-purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90:161-175, 1990.
69. J. D. Farmer, N. Packard, and A. Perelson. The immune system, adaptation and machine learning. Physica D, 22:187-204, 1986.
70. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-134, 1995.
71. P. Festa and M.G.C. Resende. Hybrid grasp heuristics. In Studies in Computational Intelligence-Foundations of Computational Intelligence Volume 3, pages 75-100. Springer Science + Business Media, 2008.
72. F. Fidanova. Ant colony optimization for multiple knapsack problem and model bias. volume 3401 of Lecture Notes in Computer Science, pages 280-287. NAA 2004, Springer-Verlag Berlin Heidelberg, 2005.
73. H. Fisher and G.L. Thompson. Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth and G.L. Thompson, editors, Industrial Scheduling, pages 225-251. Prentice Hall, Englewood Cliffs, New Jersey, 1963.
74. M. Fisher. Handbooks in Operations Research and Management Science: Network Routing, chapter Vehicle Routing, pages 1-33. North-Holland, 1995.
75. M. Florian, P. Trepant, and G. McMahon. An implicit enumeration algorithm for the machine sequencing problem. Management Science, Application Series, 17(12):B782-B792, 1971.
76. L. R. Foulds. The heuristic problem-solving approach. Journal of the Operational Research Society, 34:927-934, 1983.
77. S. French. Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop. Ellis Horwood, Chichester, 1982.
78. B. Funke, T. Gr̈unert, and S. Irnich. A note on single alternating cycle neighborhoods for the TSP. Journal of Heuristics, 11:135-146, 2005.
79. H. L. Gantt. Efficiency and democracy. Transactions of the ASME, 40:799-808, 1919.
80. M. R. Garey, D. S. Johnson, and R. Sethi. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research, 1:117-129, 1976.
81. S. Geman and D. Geman. Stochastic relaxation, Gibbs distribution and Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721-741, 1984.
82. M. Gendreau. An introduction to tabu search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, chapter 2, pages 37-54. Kluwer Academic Publishers, 2003.
83. M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276-1290, 1994.
84. M. Gendreau, G. Laporte, and J.-Y. Potvin. Metaheuristics for the capacitated vrp. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, USA, 2001.
85. M. Gendreau, G. Laporte, and J.-Y. Potvin. Vehicle routing: modern heuristics. In E. H. L. Aarts and J. K. Lenstra, editors, Local search in combinatorial optimization. Princeton University Press, 2003.
86. M. Gendreau and J.-Y. Potvin. Metaheuristics in Combinatorial Optimization. Annals of Operations Research, 140:189-213, 2005.
87. M. Gendreau, J.-Y. Potvin, O. Br̈aysy, G. Hasle, and A. Løkketangen. Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In B. Golden, S. Raghavan, and E.Wasil, editors, The Vehicle Routing Problem-Latest Advances and New Challenges. Springer Verlag, Heidelberg, 2008.
88. B. Gidas. Non-stationary markov chains and convergence of the annealing algorithm. Journal of Statistical Physics, 39:73-131, 1985.
89. B. Giffler and G. L. Thompson. Algorithms for solving production scheduling problems. Operations Research, 8:487-503, 1960.
90. F. Glover. Heuristics for integer programming using surrogate constraints. Decision Sciences, 8:156-166, 1977.
91. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13:533-549, 1986.
92. F. Glover. Tabu search-part i. ORSA Journal on Computing, 1:190-206, 1989.
93. F. Glover. Tabu search-part ii. ORSA Journal on Computing, 2:4-32, 1990.
94. F. Glover. A template for scatter search and path relinking. Lecture Notes on Computer Science, 1363:1-51, 1998.
95. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
96. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Longman, 1989.
97. J. Grabowski, E. Nowicki, and C. Smutnicki. Block algorithm for scheduling operations in a job-shop system. Przeglad Statystyczny, 35(1):67-80, 1988.
98. P. P. Grasśe. La reconstruction du nid et les coordinations interindividuelles chez bellicositermes natalensis et cubitermes sp. La th́eorie de la stigmergie: Essai d'interpŕetation du comportement des termites constructeurs. Insectes Sociaux, 1959.
99. T. Gr̈unert and S. Irnich. Optimierung im Transport-Band II: Wege und Touren. Shaker Verlag, 2005.
100. B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2):311-329, May 1988.
101. P. Hansen and N. Mladenovíc. Variable neighborhood search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, chapter 6, pages 145-184. Kluwer Academic Publishers, 2003.
102. P. Hansen and N. Mladenovíc. Variable neighborhood search. In Edmund K. Burke and Graham Kendall, editors, Search Methodologies-Introductory Tutorials in Optimization and Decision Support Techniques, chapter 8, pages 211-238. Springer Science + Business Media, Inc., 2005.
103. R. Haupt. A survey of priority-rule based scheduling. OR Spektrum, 11:3-16, 1989.
104. A. Hertz and D. de Werra. The tabu search metaheuristic: How we used it. Annals of Mathematics and Artificial Intelligence, 1:111-121, 1991.
105. A. Hertz, E. Taillard, and D. deWerra. A tutorial on tabu search. In Proceedings of Giornate di Lavoro AIRO'95 (Enterprise Systems: Management of Technological and Organizational Changes), pages 13-24, Italy, 1995.
106. A. Hertz and M. Widmer. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research, 151:247-252, 2003.
107. J. Homberger and H. Gehring. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 162(1):220-238, 2005.
108. J.N. Hooker. Testing heuristics: We have it all wrong. Journal of Heuristics, 1:33-42, 1995.
109. H. H. Hoos and T. Sẗutzle. Stochastic Local Search. Morgan Kaufmann, 2005.
110. T. C. Hu, A. B. Kahing, and C. W. A. Tsao. Old bachelor acceptance: A new class of nonmonotone threshold accepting methods. ORSA Journal on Computing, 7:417-425, 1995.
111. A. Jain, B. Rangaswamy, and S. Meeran. Job-shop neighbourhoods and move evaluation strategies. Technical report, University of Dundee, Department of Applied Physics, Electronic and Mechanical Engineering, 1998.
112. A. Jain, B. Rangaswamy, and S. Meeran. New and "stronger" job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996). Journal of Heuristics, 6:457-480, 2000.
113. A. S. Jain and S. Meeran. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2):390-434, 1999.
114. N. R. Jennings, K. Sycara, and M. Wooldridge. A roadmap of agent research and development. Autonomous Agents and Multi-Agent Systems, 1:7-38, 1998.
115. D. S. Johnson and L. A. McGeoch. The traveling salesman problem: A case study. In E. H. L. Aarts and J. K. Lenstra, editors, Local search in combinatorial optimization. Princeton University Press, 2003.
116. D.S. Johnson. A theoretician's guide to the experimental analysis of algorithms. In Goldwasser M., D. S. Johnson, and McGeoch C. C., editors, Data Structures, Near Neighbor Searches, and Methodology: Proceedings fo the Fifth and Sixth DIMACS implementation challenges, Providence, 2002. American Mathematical Society.
117. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
118. G. A. P. Kindervater and M. W. P. Savelsbergh. Vehicle routing: handling edge exchanges. In E. H. L. Aarts and J. K. Lenstra, editors, Local search in combinatorial optimization. Princeton University Press, 2003.
119. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
120. S. Kobayashi, I. Ono, and M. Yamamura. An efficient genetic algorithm for job shop scheduling problems. In Proceedings of the 6th ICGA, pages 506-511, 1995.
121. R. Kohli, R. Krishnamurti, and P. Mirchandani. Average performance of greedy heuristics for the integer knapsack problem. European Journal of Operational Research, 154:36-45, 2004.
122. M. Kolonko. Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research, 113:123-136, 1999.
123. M. Kolonko and M. T. Tran. Convergence of simulated annealing with feedback temperature schedules. Probability in the Engineering and Informational Sciences, 11:279-304, 1997.
124. M. Kong, P. Tian, and Y. Kao. A new ant colony optimization algorithm for the multidimensional knapsack problem. Computers and Operations Research, 35:2672-2683, 2008.
125. G. Kontoravdis and J. F. Bard. A grasp for the vehicle routing problem with time windows. ORSA Journal on Computing, 7(1):10-23, 1995.
126. M. A. Krajewska and H. Kopfer. Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. European Journal of Operational Research, 197(2):741-751, 2009.
127. O. Kulak, I. O. Yilmaz, and H.-O. G̈unther. A ga-based solution approach for balancing printed circuit board assembly lines. OR Spectrum, 30(3):469-491, 2007.
128. M. Laguna. Scatter search. In Handbook of Applied Optimization, chapter 3.6.6, pages 183-193. Oxford University Press, 2002.
129. G. Laporte, M. Gendreau, J.-Y. Potvin, and F. Semet. Classical and modern heuristics for the vehicle routing problem. International Transaction in Operational Research, 7:285-300, 2000.
130. G. Laporte and F. Semet. Classical heuristics for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, USA, 2001.
131. G. Laporte and F. Semet. Classical heuristics for the capacitated VRP, chapter 5, pages 109-128. SIAM Monographs on Discrete Mathematics and Applications, 2002.
132. G. Leguizamon and Z. Michalewicz. A new version of ant system for subset problems. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC 99), volume 2, pages 1459-1464, 1999.
133. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
134. S. Lin. Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44:2245-2269, 1965.
135. H. R. Lourenço, O. Martin, and T. Sẗutzle. Iterated Local Search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 321-353. Kluwer Academic Publishers, 2002.
136. M. Lundy and A. Mees. Convergence of an annealing algorithm. Mathematical Programming, 34:111-124, 1986.
137. A. S. Manne. On the job shop scheduling problem. Operations Research, 8:219-223, 1960.
138. R. Mart́i, M. Laguna, and F. Glover. Principles of scatter search. European Journal of Operational Research, 169:359-372, 2006.
139. H. Matsuo, C. J. Suh, and R. S. Sullivan. A controlled search simulated annealing method for the general job-shop scheduling problem. Working Paper #03-04-88, Graduate School of Business, The University of Texas, Austin, Texas, 1988.
140. D. C. Mattfeld. Evolutionary Search and the Job Shop. Physica-Verlag, 1996.
141. D. Merkle and M. Middendorf. Swarm intelligence. In Edmund K. Burke and Graham Kendall, editors, Search Methodologies-Introductory Tutorials in Optimization and Decision Support Techniques, chapter 8, pages 401-435. Springer Science + Business Media, Inc., 2005.
142. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
143. H. Meyr, J. Rohde, M.Wagner, and U.Wetterauer. Architecture of selected aps. In H. Stadtler and C. Kilger, editors, Supply Chain Management and Advanced Planning, chapter 18, pages 341-353. Springer Verlag, 3 edition, 2005.
144. Z. Michalewicz and D. B. Fogel. How to Solve It: Modern Heuristics. Springer-Verlag, 2004.
145. M. Mitchell. An Introduction to Genetic Algorithms. The MIT Press, 1996.
146. D. Mitra, F. Romeo, and A. L. Sangiovanni-Vincentelli. Convergence and finite time behaviour of simulated annealing. Advances in Applied Probability, 18:747-771, 1986.
147. N. Mladenovíc and P. Hansen. Variable neighborhood search. Computers and Operations Research, 24(11):1097-1100, 1997.
148. P. Moscato and J. F. Fontanari. Convergence and finite-time behavior of simulated annealing. Advances in Applied Probability, 18:747-771, 1990.
149. H.M̈uhlenbein. Genetic algorithms. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, chapter 6, pages 137-171. Princeton University Press, 2003.
150. H. M̈uller-Merbach. Heuristics and their design: A survey. European Journal of Operational Research, 8:1-23, 1981.
151. T. A. J. Nicholson. A sequential method for discrete optimization problems and its application to the assignment, travelling salesman and three scheduling problems. Journal of the Institute of Mathematics and its Applications, 13:362-375, 1965.
152. T. A. J. Nicholson. A method for optimizing permutation problems and its industrial applications. In Combinatorial Mathematics and its Applications, pages 201-217. Academic Press, London, 1971.
153. Y. Nourani and B. Andresen. A comparison of simulated annealing cooling strategies. Journal of Physics A-Mathematical and General, 31:8373-8385, 1998.
154. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop scheduling problem. Management Science, 42(6):797-813, 1996.
155. J. D. Nulton and P. Salamon. Statistical mechanics of combinatorial optimization. Physical Review A, 37:1351-1356, 1988.
156. B. Ombuki-Berman and F. T. Hanshar. Using genetic algorithms for multi-depot vehicle routing. In F. B. Pereira and J. Tavares, editors, Bio-inspired Algorithms for the Vehicle Routing Problem. Springer Verlag, Heidelberg, 2009.
157. I. Ono, M. Yamamura, and S. Kobayashi. A genetic algorithm for job-shop scheduling problems using job-based order crossover. In Proceedings of 1996 ICEC, pages 547-552, 1996.
158. I. H. Osman. Preface: Focused issue on appplied meta-heuristics. Computers & Industrial Engineering, 44:205-207, 2002.
159. I. H. Osman and G. Laporte. Metaheuristics: A bibliography. Annals of Operations Research, 63:513-623, 1996.
160. I.H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41(1-4):421-451, 1993.
161. S. S. Panwalkar and W. Iskander. A survey of scheduling rules. Operations Research, 25(1):45-61, 1977.
162. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley, New York, 1983.
163. E. Pesch. Learning in Automated Manufacturing: A Local Search Approach. Physica-Verlag, Heidelberg, Germany, 1994.
164. B. Pfahringer. A multi-agent approach to open shop scheduling: Adapting the Ant-Q formalism. Technical Report TR-96-09, sterreichisches Forschungsinstitut fr Artificial Intelligence, Wien, 1996.
165. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 2nd edition, 2002.
166. D. B. Porter. The Gantt chart as applied to production scheduling and control. Naval Research Logistics Quarterly, 15:311-317, 1968.
167. C. N. Potts. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28(6):1436-1441, 1980.
168. C. Reeves. Genetic algorithms. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, chapter 3, pages 55-82. Kluwer Academic Publishers, 2003.
169. M. G. C Resende and C. C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, chapter 8, pages 219- 249. Kluwer Academic Publishers, 2003.
170. M.G.C. Resende. Greedy randomized adaptive search procedures (grasp). Journal of Global Optimization, 6:109-133, 1999.
171. R. G. Reynolds and C.-J. Chung. A cultural algorithm framework to evolve multi-agent cooperation with evolutionary programming. In Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, pages 323-334. Springer, 1997.
172. R. G. Reynolds and W. Sverdlik. Problem solving using cultural algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 2, pages 645-650, 1994.
173. F. Romeo and A. Sangiovanni-Vincentelli. A theoretical framework for simulated annealing. Algorithmica, 6:302-345, 1991.
174. L. M. Rousseau and M. Gendreau. Using constraints-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, 8:43-58, 2002.
175. B. Roy and B. Sussmann. Les probl̀emes d'ordonnancement avec contraintes disjonctives. Note D.S. no. 9 bis, SEMA, Paris, France, D́ecembre 1964.
176. K. Sastry, D. Goldberg, and G. Kendall. Genetic algorithms. In Edmund K. Burke and Graham Kendall, editors, Search Methodologies-Introductory Tutorials in Optimization and Decision Support Techniques, chapter 4, pages 97-125. Springer Science + Business Media, Inc., 2005.
177. M. W. P. Savelsbergh. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing, 4(2):146-154, 1992.
178. E. A. Silver. An overview of heuristic solution methods. Journal of Operations Research, 55:936-956, 2004.
179. S. Singh and R. Sharma. A review of different approaches to the facility layout problems. International Journal of Advanced Manufacturing Technology, 30(5-6):425-433, 2006.
180. J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2:33-45, 1990.
181. P. N. Strenski and S. Kirkpatrick. Analysis of finite length annealing schedules. Algorithmica, 6:346-366, 1991.
182. T. Sẗutzle. Local Search Algorithms for Combinatorial Problems-Analysis, Algorithms and New Applications. PhD thesis, TU Darmstadt, 1999.
183. T. Sẗutzle and H. Hoos. MAX-MIN ant system. Future Generation Computer Systems, 16(8):889-914, 2000.
184. E. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17:443-455, 1991.
185. E. Taillard. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6:108-117, 1994.
186. E. D. Taillard, L. M. Gambardella, M. Gendreau, and J.-Y. Potvin. Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135:1-16, 2001.
187. D. Teodorovic and M. Dell'orco. Bee colony optimization-a cooperative learning approach to complex transportation problems. In Proceedings of the 16th Mini-EURO Conference on Advanced OR and AI Methods in Transportation, pages 51-60, 2005.
188. S. Thangiah. Vehicle routing with time windows using genetic algorithms. In L. Chambers, editor, Practical Handbook of Genetic Algorithms: Volume 2: New Frontiers, chapter 11, pages 253-277. CRC Press, 1995.
189. J. Timmis, P. Andrews, N. Owens, and E. Clark. An interdisciplinary perspective on artificial immune systems. Evolutionary Intelligence, 1(1):5-26, 2008.
190. P. Toth and D. Vigo. An overview of vehicle routing problems. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Application, Philadelphia, PA, USA, 2001.
191. A. Udomsakdigool and V. Kachitvichyanukul. Multiple colony ant algorithm for job-shop scheduling problem. International Journal of Production Research, 46(15):4155-4175, 2008.
192. R. Uzsoy and C.-S. Wang. Performance of decomposition procedures for job shop scheduling problems with bottleneck machines. International Journal of Production Research, 38(6):1271-1286, 2000.
193. P. J. M. Van Laarhoven, E. H. L. Aarts, and J. K. Lenstra. Job shop scheduling by simulated annealing. Report OS-R8809, Centrum voor Wiskunde en Informatica, 1988.
194. P. J. M. Van Laarhoven, E. H. L. Aarts, and J. K. Lenstra. Job shop scheduling by simulated annealing. Operations Research, 40(1):113-125, 1992.
195. J. M. Varanelli. On the Acceleration of Simulated Annealing. PhD thesis, Faculty of the School of Engineering and Applied Science, University of Virginia, May 1996.
196. S. Voß, S. Martello, I. H. Osman, and C. Roucairol, editors. Meta-Heuristics-Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999.
197. G. Ẅascher, H. Haußner, and H. Schumann. An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3):1109-1130, 2007.
198. F. Werner and A. Winkler. Insertion techniques for the heuristic solution of the job-shop problem. Discrete Applied Mathematics, 58(2):191-211, 1995.
199. S. R. White. Concepts of scale in simulated annealing. In Proceeedings of the IEEE International Conference on Computer Design (ICCD) '84, pages 646-651, Port Chester, NY, 1984.
200. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, 1997.
201. A. Wren. Heuristics ancient and modern: Transport scheduling through the ages. Journal of Heuristics, 4(1):87-100, 1998.
202. M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 32(3):33-55, 2001.
203. T. Yamada and R. Nakano. Conventional genetic algorithm for job-shop scheduling problems. In Proceedings of International Conference on Genetic Algorithms (ICGA '91), pages 474-479, 1991.
204. T. Yamada and R. Nakano. A genetic algorithm applicable to large-scale job-shop problems. In Proc. of The Second International Conference on Parallel Problem Solving from Nature PPSN '92, pages 281-290, 1992.
205. T. Yamada and R. Nakano. A genetic algorithm with multi-step crossover for job-shop scheduling problems. In Proceedings of the 1st IEE/IEEE Int. Conf. on Genetic Algorithms in Engineering Systems (GALESIA '95), pages 146-151, 1995.
206. T. Yamada and R. Nakano. Job-shop scheduling by simulated annealing combined with deterministic local search. In Meta-heuristics: Theory and Applications, pages 237-248. Kluwer academic publishers MA, USA, 1996.
207. T. Yamada and R. Nakano. Genetic algorithms for job-shop scheduling problems. In Proceedings of Modern Heuristic for Decision Support, pages 67-81, London, March 1997. UNICOM seminar.
208. S. H. Zanakis, J. R. Evans, and A. A. Vazacopoulos. Heuristic methods and applications: A categorized survey. European Journal of Operational Research, 43:88-110, 1989.
209. G. Z̈apfel and M. B̈ogl. Multi-period vehicle routing and crew scheduling with outsourcing options. International Journal of Production Economics, 113(2):980-996, 2008. Special Section on Advanced Modeling and Innovative Design of Supply Chain.
210. G. Z̈apfel and M.Wasner. A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing. International Journal of Production Economics, 68:199-213, 2000.
211. C. Y. Zhang, P. Li, Z. Guan, and Y. Rao. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research, 34:3229- 3242, 2007.