An Introduction to Metaheuristic Techniques

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 1-42

  Blum, Christian ^a   Roli, Andrea ^b   Alba, Enrique ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CHIETI   (Italy)

^c UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Constructive heuristics; Local search methods; Metaheuristics; Simulated annealing; Trajectory methods

Indexed keywords

EID: 84889385471     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch1     Document Type: Editorial

References (148)

1. E. H. L. Aarts, J. H. M. Korst, and P. J. M. van Laarhoven. Simulated annealing. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 91-120. John Wiley & Sons, Chichester, UK, 1997.
2. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 1997.
3. R. M. Aiex, S. Binato, and M. G. C. Resende. Parallel GRASP with pathrelinking for job shop scheduling. Parallel Computing, 29(4):393-430,2003.
4. E. Alba, F. Luna, A. J. Nebro, and J. M. Troya. Parallel Heterogeneous Genetic Algorithms for Continuous Optimization. Parallel Computing, 30(5-6):699-719, 2004.
5. E. Alba and M. Tomassini. Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5):443462, October 2002.
6. E. Alba and J. M. Troya. Improving flexibility and efficiency by adding parallelism to genetic algorithms. Statistics and Computing, 12(2):91-114,2002.
7. E. Alba and J.M. Troya. A survey of parallel distributed genetic algorithms. Complexity, 4(4):31-52, 1999.
8. T. Back. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
9. T. Back, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol, UK, 1997.
10. S. Baluja. Structure and performance of fine-grain parallelism in genetic search. In S. Forrest, editor, Proceedings ofthe Fifih International Conference on Genetic Algorithms, pages 155-162. Morgan Kaufmann, 1993.
11. S. Baluja and R. Caruana. Removing the Genetics from the Standard Genetic Algorithm. In A. Prieditis and S. Russel, editors, The International Conference on Machine Learning 1995, pages 3846, San Mateo, California, 1995. Morgan Kaufmann Publishers.
12. R. Battiti and M. Protasi. Reactive Search, a history-base heuristic for MAXSAT. ACM Journal of Experimental Algorithmics, 2:Article 2, 1997.
13. R. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6(2):126-140, 1994.
14. T. C. Belding. The distributed genetic algorithm revisited. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 114-121. Morgan Kaufmann, 1995.
15. H. Bersini and G. Seront. In search of a good evolution-optimization crossover. In R. Manner and B. Manderick, editors, Proceedings of PPSN-II, Second International Conference on Parallel Problem Solving from Nature, pages 479-488. Elsevier, Amsterdam, The Netherlands, 1992.
16. S. Binato, W. J. Hery, D. Loewenstem, and M. G. C. Resende. A greedy randomized adaptive search procedure for job shop scheduling. In P. Hansen and C. C. Ribeiro, editors, Essays and Surveys on Metaheuristics. Kluwer Academic Publishers. 2001.
17. C. Blum. Beam-ACO-Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research, 32(6):1565-1591,2005.
18. 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.
19. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308,2003.
20. P. CalCgary, G. Coray, A. Hertz, D. Kobler, and P. Kuonen. A taxonomy of evolutionary algorithms in combinatorial optimization. Journal of Heuristics, 5: 145-158. 1999.
21. V. Campos, F. Glover, M. Laguna, and R. Marti. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem. Journal of Global Optimization, 21:397-414.2001.
22. D. J. Cavicchio. Adaptive search using simulated evolution. PhD thesis, University of Michigan, Ann Arbor, MI, 1970.
23. V. Cerny. A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45141-51. 1985.
24. P. Chardaire, J. L. Lutton, and A. Sutter. Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms. European Journal of Operational Research, 86:565-579, 1995.
25. R. Chelouah and P. Siarry. A continuous genetic algorithm designed for the global optimization of multimodal functions. Journal of Heuristics, 6: 191-213, 2000.
26. R. Chelouah and P. Siarry. Tabu search applied to global optimization. European Journal of Operational Research, 123:256-270,2000.
27. R. Chelouah and P. Siarry. Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. European Journal of Operational Research, 148:335-348,2003.
28. C. A. Coello Coello. An Updated Survey of GA-Based Multiobjective Optimization Techniques. ACM Computing Surveys, 32(2): 109-143,2000.
29. A. Colorni, M. Dorigo, and V. Maniezzo. Metaheuristics for high school timetabling. Computational Optimization andApplications, 9(3):275-298, 1998.
30. D. T. Connolly. An improved annealing scheme for the QAP. European Journal of Operational Research, 46:93-100, 1990.
31. J. S. de Bonet, C. L. Isbell Jr., and P. Viola. MIMIC: Finding optima by estimating probability densities. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems 7 (NIPS7), pages 424-431. MIT Press, Cambridge, MA, 1997.
32. K. A. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, 1975. Dissertation Abstracts International 36(10), 5140B, University Microfilms Number 76-9381.
33. F. Della Croce and V. T'kindt. A Recovering Beam Search algorithm for the one machine dynamic total completion time scheduling problem. Journal of the Operational Research Society, 53(11): 1275-1280, 2002.
34. M. Dell'Amico, A. Lodi, and F. Maffioli. Solution of the Cumulative Assignment Problem with a well-structured Tabu Search method. Journal of Heuristics, 5: 123-143, 1999.
35. M. L. den Besten, T. Stiitzle, and M. Dorigo. Design of iterated local search algorithms: An example application to the single machine total weighted tardiness problem. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, G. R. Raidl, and H. Tijink, editors, Applications of Evolutionary Computing: Proceedings of Evo Workshops 2001, volume 2037 of Lecture Notes in Computer Science, pages 441-452. Springer Verlag, Berlin, Germany, 2001.
36. J.-L. Deneubourg, S. Aron, S. Goss, and J.-M. Pasteels. The self-organizing exploratory pattern of the argentine ant. Journal of Insect Behaviour, 3: 159-168,1990.
37. J. Denzinger and T. Offerman. On cooperation between evolutionary algorithms and other search paradigms. In Proceedings of Congress on Evolutionary Computation-CEC'1999, pages 2317-2324, 1999.
38. G. Di Carp and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9:317-365, 1998.
39. M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992.
40. M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2): 137-172, 1999.
41. 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.
42. M. Dorigo, V. Maniezzo, and A. Colorni. Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Svstems, Mun, and Cvbernetics-Part B, 26(1):2941, 1996.
43. M. Dorigo and T. Stiitzle. http://www.metaheuristics.net/, 2000. Visited in January 2003.
44. M. Dorigo and T. Stiitzle. The ant colony optimization metaheuristic: Algorithms, applications and advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 251-285. Kluwer Academic Publishers, Norwell, MA, 2002.
45. M. Dorigo and T. Stiitzle. Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.
46. J. Dréo and P. Siarry. A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. In M. Dorigo, G. Di Caro, and M. Sampels, editors, Proceedings of ANTS 2002-From Ant Colonies to Artificial Ants: Third International Workshop on Ant Algorithms, volume 2463 of Lecture Notes in Computer Science, pages 216-221. Springer Verlag, Berlin, Germany, 2002.
47. G. Dueck. New Optimization Heuristics. Journal of Computational Physics, 104:86-92, 1993.
48. 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.
49. A. E. Eiben, P.-E. Raué, and Z. Ruttkay. Genetic algorithms with multi-parent recombination. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, volume 866 of Lecture Notes in Computer Science, pages 78-87, Berlin, 1994. Springer.
50. A. E. Eiben and Z. Ruttkay. Constraint satisfaction problems. In T. Back, D. Fogel, and M. Michalewicz, editors, Handbook ofEvolutionary Computation. Institute of Physics Publishing Ltd, Bristol, UK, 1997.
51. A. E. Eiben and C. A. Schippers. On evolutionary exploration and exploitation. Fundamenta Informaticae, 35: 1-16, 1998.
52. W. Feller. An Introduction to Probability Theory and its Applications. John Whiley, 1968.
53. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global optimization, 6:109-133, 1995.
54. P. Festa and M. G. C. Resende. GRASP: An annotated bibliography. In C. C. Ribeiro and P. Hansen, editors, Essays and Surveys on Metaheuristics, pages 325-367. Kluwer Academic Publishers, 2002.
55. M. Fleischer. Simulated Annealing: past, present and future. In C. Alexopoulos, K. Kang, W. R. Lilegdon, and G. Goldsman, editors, Proceedings ofthe 1995 Winter Simulation Conference, pages 155-161, 1995.
56. F. Focacci, F. Laburthe, and A. Lodi. Local Search and Constraint Programming. In F. Glover and G. Kochenberger, editors, Handbook OfMetaheuristics, volume 57 of International Series in Operations Research & Management Science. Kluwer Academic Publishers, Norwell, MA, 2002.
57. D. B. Fogel. An introduction to simulated evolutionary optimization. ZEEE Transactions on Neural Networks, 5(1):3-14, January 1994.
58. G. B. Fogel, V. W. Porto, D. G. Weekes, D. B. Fogel, R. H. Griffey, J. A. McNeil, E. Lesnik, D. J. Ecker, and R. Sampath. Discovery of RNA structural elements using evolutionary computation. Nucleic Acids Research, 30(23):53 10-53 17, 2002.
59. L. J. Fogel. Toward inductive inference automata. In Proceedings of the International Federation for Information Processing Congress, pages 395-399, Munich, 1962.
60. L. J. Fogel, A. J. Owens, and M. J. Walsh. Artificial Intelligence through Simulated Evolution. Wiley, 1966.
61. C. Fonlupt, D. Robilliard, P. Preux, and E. G. Talbi. Fitness landscapes and performance of meta-heuristics. In S. Volβ, S. Martello, 1. Osman, and C. Roucairol, editors, Meta-heuristics: udvunces and trends in local search paradigms for optimization. Kluwer Academic, 1999.
62. L. M. Gambardella and M. Dorigo. Ant Colony System hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12(3): 237-255,2000.
63. M. R. Garey and D. S. Johnson. Computers and intractability; u guide to the theory of NP-completeness. W. H. Freeman, 1979.
64. M. Gendreau, G. Laporte, and J.-Y. Potvin. Metaheuristics for the capacitated VRP. In P. Toth and D. Vigo, editors, The Vehicle Routing Problem, volume 9 of SIAM Monographs on Discrete Mathematics and Applications, pages 129-154. SIAM, Philadelphia, 2002.
65. F. Glover. Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences, 8: 156-166, 1977.
66. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533-549,1986.
67. F. Glover. Tabu Search Part 11. ORSA Journal on Computing, 2(1):4-32, 1990.
68. F. Glover. Scatter search and path relinking. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, Advanced topics in computer science series. McGraw-Hill, 1999.
69. F. Glover and G. Kochenberger, editors. Handbook of Metaheuristics. Kluwer Academic Publishers, Nonvell, MA, 2002.
70. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
71. F. Glover, M. Laguna, and R. Marti. Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3):653-684,2000.
72. F. Glover, M. Laguna, and R. Marti. Scatter Search and Path Relinking: Advances and Applications. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science. Kluwer Academic Publishers, Nonvell, MA, 2002.
73. D. E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading, MA, 1989.
74. D. E. Goldberg and J. Richardson. Genetic algorithms with sharing for multimodal function optimization. In J. J. Grefenstette, editor, Genetic Algorithms and their Applications, pages 41-139. Lawrence Erlbaum Associates, Hillsdale, NJ. 1987.
75. V. S. Gordon and D. Whitley. Serial and parallel genetic algorithms as function optimizers. In S. Forrest, editor, Proceedings of the F$h International Conference on Genetic Algorithms, pages 177-183. Morgan Kaufmann, 1993.
76. P. Hansen. The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy, 1986.
77. P. Hansen and N. Mladenović. Variable Neighborhood Search for the pMedian. Location Science, 5:207-226, 1997.
78. P. Hansen and N. Mladenovid. Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130:449-467,2001.
79. A. Hertz and D. Kobler. A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126: 1-12,2000.
80. T. Hogg and C. P. Williams. Solving the really hard problems with cooperative search. In Proceedings ofAAAI93, pages 213-235. AAAI Press, 1993.
81. J. H. Holland. Adaption in natural and artijicial systems. The University of Michigan Press, Ann Harbor, MI, 1975.
82. L. Ingber. Adaptive simulated annealing (ASA): Lessons learned. Control and Cybernetics-Special Issue on Simulated Annealing Applied to Combinatorial Optimization, 25(1):33-54, 1996.
83. 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, pages 215-310. John Wiley & Sons, Chichester, UK, 1997.
84. T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, Univ. of New Mexico, Albuquerque, NM, 1995.
85. D. E. Joslin and D. P. Clements. "Squeaky Wheel" Optimization. Journal qf Art!iicial Intelligence Research, 10:353-373, 1999.
86. P. Kilby, P. Prosser, and P. Shaw. Guided Local Search for the Vehicle Routing Problem with time windows. In S. Voβ, S. Martello, I. Osman, and C. Roucairol, editors, Meta-heuristics: advances and trends in local search paradigms for optimization, pages 473-486. Kluwer Academic, 1999.
87. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):67 1-680, 1983.
88. M. Laguna, H. R. Lourenço, and R. Marti. Assigning Proctors to Exams with Scatter Search. In M. Laguna and J. L. Gonzalez-Velarde, editors, Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pages 215-227. Kluwer Academic Publishers, Boston, MA, 2000.
89. M. Laguna and R. Marti. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS Journal on Computing, 1 1(1):44-52, 1999.
90. M. Laguna, R. Marti, and V. Campos. Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem. Computers and Operations Research, 26:1217-1230, 1999.
91. P. Larraiiaga and J. A. Lozano, editors. Estimation OfDistribution Algorithms: A New, Too1,for Evolutionary Cornputation. Kluwer Academic Publishers, Boston, MA, 2002.
92. E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The Travelling Salesman Problem. John Wiley & Sons, New York, NY, 1985.
93. H. R. Lourenqo, O. Martin, and T. Stiitzle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 321-353. Kluwer Academic Publishers, Nonvell, MA, 2002.
94. M. Lundy and A. Mees. Convergence of an annealing algorithm. Mathematical Programming, 34(1):111-124, 1986.
95. S.W. Mahfoud. NichingMethods.for Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 1995.
96. B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithms. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 428-433. Morgan Kaufmann, 1989.
97. O. Martin and S. W. Otto. Combining Simulated Annealing with Local Search Heuristics. Annals of Operations Research, 63:57-75, 1996.
98. O. Martin, S. W. Otto, and E. W. Felten. Large-step markov chains for the traveling salesman problem. Complex Systems, 5(3):299-326, 1991.
99. M. Mathur, S. B. Karale, S. Priye, V. K. Jyaraman, and B. D. Kulkami. Ant colony approach to continuous hnction optimization. Industrial & Engineering Chemistry Research, 39:3814-3822, 2000.
100. D. Merkle, M. Middendorf, and H. Schmeck. Ant Colony Optimization for Resource-Constrained Project Scheduling. IEEE Trunsuctions on Evolutionary Computation, 6(4):333-346,2002.
101. 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.
102. Z. Michalewicz and M. Michalewicz. Evolutionary computation techniques and their applications. In Proceedings of the IEEE International Conference on Intelligent Processing Systems, pages 14-24, Beijing, China, 1997. Institute of Electrical & Electronics Engineers, Incorporated.
103. P. Mills and E. Tsang. Guided Local Search for solving SAT and weighted MAX-SAT Problems. In Ian Gent, Hans van Maaren, and Toby Walsh, editors, SAT2000, pages 89-106. 10s Press, 2000.
104. M. Mitchell. An introduction to genetic algorithms. MIT press, Cambridge, MA, 1998.
105. N. Mladenovid and D. Urošević. Variable Neighborhood Search for the k-Cardinality Tree. In Proceedings of the Fourth Metaheuristics International Conference, volume 2, pages 743-747,2001.
106. P. Moscato. Memetic algorithms: A Short Introduction. In F. Glover, D. Corne and M. Dorigo, editors, New Ideas in Optimization. McGraw-Hill, 1999.
107. H. Miihlenbein. Evolution in time and space-the parallel genetic algorithm. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann, San Mateo, USA, 1991.
108. H. Miihlenbein and G. Paaβ. From recombination of genes to the estimation of distributions. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Proceedings of the 4th Conference on Parallel Problem Solving.from Nature-PPSN IV, volume 1411 of Lecture Notes in Computer Science, pages 178-187, Berlin, 1996. Springer.
109. H. Miihlenbein and H.-M. Voigt. Gene Pool Recombination in Genetic Algorithms. In I. H. Osman and J. P. Kelly, editors, Proc. ofthe Metaheuristics Co&nnce, Nonvell, USA, 1995. Kluwer Academic Publishers.
110. J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-3 13, 1965.
111. G. L. Nemhauser and A. L. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988.
112. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job-shop problem. Management Science, 42(2):797-813, 1996.
113. I. H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421-45 1, 1993.
114. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization-Algorithms and Complexity. Dover Publications, Inc., New York, 1982.
115. M. Pelikan, D. E. Goldberg, and E. Cantu-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings ofthe Genetic and Evolutionmy Computation Conference (GECCO-1999), volume I, pages 525-532. Morgan Kaufmann Publishers, San Fransisco, CA, 1999.
116. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Technical Report No. 99018, IlIiGAL, University of Illinois, 1999.
117. L. S. Pitsoulis and M. G. C. Resende. Greedy Randomized Adaptive Search procedure. In P. M. Pardalos and M. G. C. Resende, editors, HandbookofApplied Optimization, pages 168-183. Oxford University Press, 2002.
118. M. Prais and C. C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12: 164-176, 2000.
119. S. Prestwich. Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search. Annals of Operations Research, 115:51-72, 2002.
120. N. J. Radcliffe. Forma Analysis and Random Respectful Recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, ICGA 1991, pages 222-229. Morgan Kaufmann Publishers, San Mateo, California, 1991.
121. I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nnch Prinzipien der biologischen Evolution. Frommann-Holzboog, 1973.
122. C. R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, Oxford, England, 1993.
123. C. R. Reeves. Landscapes, operators and heuristic search. Annals of Operations Research, 86:473-490, 1999.
124. C. R. Reeves and J. E. Rowe. Genetic Algorithms: Principles and Perspectives. A Guide to GA Theory. Kluwer Academic Publishers, Boston (USA), 2002.
125. M. G. C. Resende and C. C. Ribeiro. A GRASP for graph planarization. Networks, 29:173-189,1997.
126. C. C. Ribeiro and M. C. Souza. Variable neighborhood search for the degree constrained minimum spanning tree problem. Discrete Applied Mathematics, 118:43-54,2002.
127. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In M. Maher and J.-F. Puget, editors, Principle and Practice of Constraint Programming-CP98, volume 1520 of Lecture Notes in Computer Science. Springer, 1998.
128. P. Siany, G. Berthiau, F. Durbin, and J. Haussy. Enhanced simulated annealing for globally minimizing functions of many-continuous variables. ACM Transactions on Mathematical Sofmare, 23(2):209-228, 1997.
129. M. Sipper, E. Sanchez, D. Mange, M. Tomassini, A. Perez-Uribe, and A. Stauffer. A Phylogenetic, Ontogenetic, and Epigenetic View of Bio-Inspired Hardware Systems. IEEE Transactions on Evolutionary Computation, 1(1):83-97, 1997.
130. K. Smyth, H. H. Hoos, and T. Stiitzle. Iterated robust tabu search for MAX-SAT. In Proc. of the 16th Canadian Conference on Artijicial Intelligence (AI'2003), volume 2671 of Lecture Notes in Computer Science, pages 129-144. Springer Verlag, 2003.
131. K. Socha. Extended ACO for continuous and mixed-variable optimization. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, and T. Stiitzle, editors, Proceedings of ANTS 2004-Fourth International Workshop on Ant Algorithms and Swarm Intelligence, Lecture Notes in Computer Science 3172, pages 25-36. Springer Verlag, Berlin, Germany, 2004.
132. L. Sondergeld and S. Voβ. Cooperative intelligent search using adaptive memory techniques. In S. Voβ, S. Martello, I. Osman, and C. Roucairol, editors, Metaheuristics: advances and trends in local search paradigms.for optimization, chapter 21, pages 297-312. Kluwer Academic Publishers, 1999.
133. W. M. Spears, K. A. De Jong, T. Back, D. B. Fogel, and H. de Garis. An overview of evolutionary computation. In P. B. Brazdil, editor, Proceedings of the European Conference on Machine Learning (ECML-93), volume 667, pages 442-459, Vienna, Austria, 1993. Springer Verlag.
134. P. F. Stadler. Landscapes and their correlation functions. Journal of Mathematical Chemistry, 20:145, 1996. Also available as SFI preprint 95-07-067.
135. R. Storn and K. Price. Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11:341-359, 1997.
136. T. Stiitzle. Local Search Algorithms for Combinatorid Problems-Analysis, Algorithms and New Applications. DISK1-Dissertationen zur Kiinstliken Intelligenz. infix, Sankt Augustin, Germany, 1999.
137. T. Stiitzle and H. H. Hoos. MAX-MZN Ant System. Future Generation Computer Systems, 16(8):889-914,2000.
138. G. Syswerda. Simulated Crossover in Genetic Algorithms. In L. D. Whitley, editor, Proceedings of the second workshop on Foundations of Genetic Algorithms, pages 239-255, San Mateo, California, 1993. Morgan Kaufmann Publishers.
139. E. D. Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17:443-455, 1991.
140. E-G. Talbi. A Taxonomy of Hybrid Metaheuristics. Journal of Heuristics, 8(5): 54 1-564,2002.
141. R. Tanese. Distributed genetic algorithms. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 434439. Morgan Kaufmann, 1989.
142. M. Toulouse, T. G. Crainic, and B. Sand. An experimental study of the systemic behavior of cooperative search algorithms. In S. VoR, S. Martello, I. Osman, and C. Roucairol, editors, Meta-heuristics: adimnces and trends in local search paradigms for optimization, chapter 26, pages 373-392. Kluwer Academic Publishers. 1999.
143. D. Urošević, J. Brimberg, and N. Mladenović. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & Operations Research, 31(8): 1205-1213,2004.
144. P. J. M. Van Laarhoven, E. H. L. Aarts, and J. K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40: 1 13-125, 1992.
145. M. D. Vose. The simple genetic algorithm: foundations and theory. MIT Press, Cambridge, MA, 1999.
146. C. Voudouris and E. Tsang. Guided Local Search. European Journal of Operational Research, 113(2):469-499, 1999.
147. A. S. Wade and V. J. Rayward-Smith. Effective local search for the steiner tree problem. Studies in Locational Analysis, 11:219-241, 1997. Also in Advances in Steiner Trees, ed. by Ding-Zhu Du, J. M.Smith and J. H. Rubinstein, Kluwer, 2000.
148. M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 32(3):33-55,2001.