Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison

ACM Computing Surveys

Volumn 35, Issue 3, 2003, Pages 268-308

  Blum, Christian ^a   Roli, Andrea ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Combinatorial optimization; Diversification; Intensification; Metaheuristics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; METADATA; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; METAHEURISTICS;

COMBINATORIAL MATHEMATICS;

EID: 0344236266     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/937503.937505     Document Type: Review

References (173)

1. AARTS, E. H. L., KORST, J. H. M., AND LAARHOVEN, P. J. M. v. 1997. Simulated annealing. In Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds. Wiley-Interscience, Chichester, England, 91-120.
2. AARTS, E. H. L. AND LENSTRA, J. K., EDS. 1997. Local Search in Combinatorial Optimization. Wiley, Chichester, UK.
3. AIEX, R. M., BINATO, S., AND RESENDE, M. G. C. 2003. Parallel GRASP with path-relinking for job shop scheduling. Paral. Comput. To appear.
4. BACHELET, V. AND TALBI, E. 2000. Cosearch: A co-evolutionary metaheuritics. In Proceedings of Congress on Evolutionary Computation CEC'2000. 1550-1557.
5. BÄCK, T. 1996. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York.
6. BÄCK, T., FOGEL, D. B., AND MACHALEWICZ, Z., EDS. 1997. Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol, UK.
7. BALUJA, S. 1994. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, Pa.
8. BALUJA, S. AND CARUANA, R. 1995. Removing the genetics from the standard genetic algorithm. In The International Conference on Machine Learning 1995, A. Prieditis and S. Russel, Eds. Morgan-Kaufmann Publishers, San Mateo, Calif., 38-46.
9. BAR-YAM, Y. 1997. Dynamics of Complex Systems. Studies in nonlinearity. Addison-Wesley, Reading, Mass.
10. BATTITI, R. 1996. Reactive search: Toward self-tuning heuristics. In Modern Heuristic Search Methods, V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith, Eds. Wiley, Chichester, UK, 61-83.
11. BATTITI, R. AND PROTASI, M. 1997. Reactive Search, A history-base heuristic for MAX-SAT. ACM J. Exper. Algor. 2, Article 2.
12. BATTITI, R. AND TECCHIOLLI, G. 1994. The reactive tabu search. ORSA J. Comput. 6, 2, 126-140.
13. BINATO, S., HERY, W. J., LOEWENSTERN, D., AND RESENDE, M. G. C. 2001. A greedy randomized adaptive search procedure for job shop scheduling. In Essays and Surveys on Metaheuristics, P. Hansen and C. C. Ribeiro, Eds. Kluwer Academic Publishers.
14. BLUM, C. 2002a. ACO applied to group shop scheduling: A case study on intensification and diversification. In Proceedings of ANTS 2002 - Third International Workshop on Ant Algorithms, M. Dorigo, G. Di Caro, and M. Sampels, Eds. Lecture Notes in Computer Science, vol. 2463. Springer Verlag, Berlin, Germany, 14-27.
15. BLUM, C. 2002b. Ant colony optimization for the edge-weighted k-cardinality tree problem. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, Eds. Morgan-Kaufmann, New York, 27-34.
16. BLUM, C., ROLI, A., AND DORIGO, M. 2001. HCACO: The hyper-cube framework for ant colony optimization. In Proceedings of MIC'2001 - Meta-heuristics International Conference. Vol. 2. Porto, Portugal, 399-403.
17. CALÉGARY, P., CORAY, G., HERTZ, A., KOBLER, D., AND KUONEN, P. 1999. A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heuristics 5, 145-158.
18. CAMPOS, V., GLOVER, F., LAGUNA, M., AND MARTÍ, R. 2001. An experimental evaluation of a scatter search for the linear ordering problem. J. Global Opt. 21, 397-414.
19. CASEAU, Y. AND LABURTHE, F. 1999. Effective forget-and-extend heuristics for scheduling problems. In Proceedings of CP-AI-OR'02 - Fourth Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems. Ferrara (Italy). Also available at: www.deis.unibo.it/Events/Deis/Workshops/Proceedings.html.
20. CERNY, V. 1985. A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45, 41-51.
21. CHARDAIRE, P., LUTTON, J. L., AND SUTTER, A. 1995. Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms. Europ. J. Oper. Res. 86, 565-579.
22. COELLO COELLO, C. A. 2000. An updated survey of GA-based multiobjective optimization techniques. ACM Comput. Surv. 32, 2, 109-143.
23. CONNOLLY, D. T. 1990. An improved annealing scheme for the QAP. Europ. J. Oper. Res. 46, 93-100.
24. CRAINIC, T. G. AND TOULOUSE, M. 2002a. Introduction to the special issue on parallel metaheuristics. J. Heuristics 8, 3, 247-249.
25. CRAINIC, T. G. AND TOULOUSE, M. 2002b. Parallel strategies for meta-heuristics. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA.
26. DE BACKER, B., FURNON, V., AND SHAW, P. 2000. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. J. Heuristics 6, 501-523.
27. DE BONET, J. S., ISBELL JR., C. L., AND VIOLA, P. 1997. MIMIC: Finding optima by estimating probability densities. In Proceedings of the 1997 Conference on Advances in Neural Information Processing Systems (NIPS'97), M. C. Mozer, M. I. Jordan, and T. Petsche, Eds. MIT Press, Cambridge, MA, 424-431.
28. DEJONG, K. A. 1975. An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Ann Arbor, MI. Dissertation Abstracts International 36(10), 5140B, University Microfilms Number 76-9381.
29. DELLA CROCE, F. AND T'KINDT, V. 2003. A Recovering Beam Search algorithm for the one machine dynamic total completion time scheduling problem. J. Oper. Res. Soc. To appear.
30. DELL'AMICO, M. AND LODI, A. 2002. On the integration of metaheuristic strategies in constraint programming. In Adaptive Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee, Eds. Kluwer Academic Publishers, Boston, MA.
31. DELL'AMICO, M., LODI, A., AND MAFFIOLI, F. 1999. Solution of the cumulative assignment problem with a well-structured tabu search method. J. Heuristics 5, 123-143.
32. DEN BESTEN, M. L., STÜTZLE, T., AND DORIGO, M. 2001. Design of iterated local search algorithms: An example application to the single machine total weighted tardiness problem. In Proceedings of EvoStim'01. Lecture Notes in Computer Science. Springer, 441-452.
33. DENEUBOURG, J.-L., ARON, S., Goss, S., AND PASTEELS, J.-M. 1990. The self-organizing exploratory pattern of the argentine ant. J. Insect Behav. 3, 159-168.
34. DENZINGER, J. AND OFFERMAN, T. 1999. On cooperation between evolutionary algorithms and other search paradigms. In Proceedings of Congress on Evolutionary Computation - CEC'1999. 2317-2324.
35. DEVANEY, R. L. 1989. An introduction to chaotic dynamical systems, second ed. Addison-Wesley, Reading, Mass.
36. DI CARO, G. AND DORIGO, M. 1998. AntNet: Distributed stigmergetic control for communication networks. J. Artif. Int. Res. 9, 317-365.
37. DORIGO, M. 1992. Optimization, learning and natural algorithms (in italian). Ph.D. thesis, DEI, Politecnico di Milano, Italy, pp. 140.
38. DORIGO, M. AND DI CARO, G. 1999. The ant colony optimization meta-heuristic. In New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. McGraw-Hill, 11-32.
39. DORIGO, M., DI CARO, G., AND GAMHARDELLA, L. M. 1999. Ant algorithms for discrete optimization. Art. Life 5, 2, 137-172.
40. DORIGO, M. AND GAMBARDELLA, L. M. 1997. Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Trans. Evolution. Comput. 1, 1 (Apr.), 53-66.
41. DORIGO, M., MANIEZZO, V., AND COLORNI, A. 1996. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernet. - Part B 26, 1, 29-41.
42. DORIGO, M. AND STÜTZLE, T. 2002. The ant colony optimization metaheuristic: Algorithms, applications and advances. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA, 251-285.
43. DORIGO, M. AND STÜTZLE, T. 2003. Ant Colony Optimization. MIT Press, Boston, MA. To appear.
44. DUECK, G. 1993. New Optimization Heuristics. J. Comput. Phy. 104, 86-92.
45. DUECK, G. AND SCHEUER, T. 1990. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phy. 90, 161-175.
46. EIBEN, A. E., RAUÉ, P.-E., AND RUTTKAY, Z. 1994. Genetic algorithms with multi-parent recombination. In Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, Y. Davidor, H.-P. Schwefel, and R. Manner, Eds. Lecture Notes in Computer Science, vol. 866. Springer, Berlin, 78-87.
47. EIBEN, A. E. AND RUTTKAY, Z. 1997. Constraint satisfaction problems. In Handbook of Evolutionary Computation, T. Bäck, D. Fogel, and M. Michalewicz, Eds. Institute of Physics Publishing Ltd, Bristol, UK.
48. EIBEN, A. E. AND SCHIPPERS, C. A. 1998. On evolutionary exploration and exploitation. Fund. Inf. 35, 1-16.
49. FELLER, W. 1968. An Introduction to Probability Theory and Its Applications. Wiley, New York.
50. FEO, T. A. AND RESENDE, M. G. C. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6, 109-133.
51. FESTA, P. AND RESENDE, M. G. C. 2002. GRASP: An annotated bibliography. In Essays and Surveys on Metaheuristics, C. C. Ribeiro and P. Hansen, Eds. Kluwer Academic Publishers, 325-367.
52. FINK, A. AND VOß, S. 1999. Generic metaheuristics application to industrial engineering problems. Comput. Indust. Eng. 37, 281-284.
53. FLEISCHER, M. 1995. Simulated Annealing: past, present and future. In Proceedings of the 1995 Winter Simulation Conference, C. Alexopoulos, K. Kang, W. Lilegdon, and G. Goldsman, Eds. 155-161.
54. FOCACCI, F., LABURTHE, F., AND LODI, A. 2002. Local search and constraint programming. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA.
55. FOGEL, D. B. 1994. An introduction to simulated evolutionary optimization. IEEE Trans. Neural Netw. 5, 1 (Jan.), 3-14.
56. FOGEL, G. B., PORTO, V. W., WEEKES, D. G., FOGEL, D. B., GRIFFEY, R. H., MCNEIL, J. A., LESNIK, E., ECKER, D. J., AND SAMPATH, R. 2002. Discovery of RNA structural elements using evolutionary computation. Nucleic Acids Res. 30, 23, 5310-5317.
57. FOGEL, L. J. 1962. Toward inductive inference automata. In Proceedings of the International Federation for Information Processing Congress. Munich, 395-399.
58. FOGEL, L. J., OWENS, A. J., AND WALSH, M. J. 1966. Artificial Intelligence through Simulated Evolution. Wiley, New York.
59. FONLUPT, C., ROBILLIARD, D., PREUX, P., AND TALBI, E. 1999. Fitness landscapes and performance of meta-heuristics. In Meta-heuristics: advances and trends in local search paradigms for optimization, S. Voß, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic.
60. FREISLEBEN, B. AND MERZ, P. 1996. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In International Conference on Evolutionary Computation. 616-621.
61. FREUDER, E. C., DECHTER, R., GINSBERG, M. L., SELMAN, B., AND TSANG, E. P. K. 1995. Systematic versus stochastic constraint satisfaction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI 1995. Vol. 2. Morgan-Kaufmann, 2027-2032.
62. GAMBARDELLA, L. M. AND DORIGO, M. 2000. Ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J. Comput. 12, 3, 237-255.
63. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman.
64. GENDREAU, M., LAPORTE, G., AND POTVIN, J.-Y. 2001. Metaheuristics for the vehicle routing problem. In The Vehicle Routing Problem, P. Toth and D. Vigo, Eds. SIAM Series on Discrete Mathematics and Applications, vol. 9. 129-154.
65. GINSBERG, M. L. 1993. Dynamic backtracking. J. Artif. Int. Res. 1, 25-46.
66. GLOVER, F. 1977. Heuristics for integer programming using surrogate constraints. Dec. Sci. 8, 156-166.
67. GLOVER, F. 1986. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533-549.
68. GLOVER, F. 1990. Tabu search Part II. ORSA J. Comput. 2, 1, 4-32.
69. GLOVER, F. 1999. Scatter search and path relinking. In New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. Advanced topics in computer science series. McGraw-Hill.
70. GLOVER, F. AND LAGUNA, M. 1997. Tabu Search. Kluwer Academic Publishers.
71. GLOVER, F., LAGUNA, M., AND MARTÍ, R. 2000. Fundamentals of scatter search and path relinking. Control, 29, 3, 653-684.
72. GLOVER, F., LAGUNA, M., AND MARTÍ, R. 2002. Scatter search and path relinking: Advances and applications. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA.
73. GOLDBERG, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA.
74. GOLDBERG, D. E., DEB, K., AND KORB, B. 1991. Don't worry, be messy. In Proceedings of the 4th International Conference on Genetic Algorithms. Morgan-Kaufmann, La Jolla, CA.
75. GOLDBERG, D. E. AND RICHARDSON, J. 1987. Genetic algorithms with sharing for multimodal function optimization. In Genetic Algorithms and their Applications, J. J. Grefenstette, Ed. Lawrence Erlbaum Associates, Hillsdale, NJ, 41-49.
76. GOMES, C. P., SELMAN, B., CRATO, N., AND KAUTZ, H. 2000. Heavy-Tayled phenomena in Satisfiability and Constraint Satisfaction Prpblems. J. Automat. Reason. 24, 67-100
77. GREFENSTETTE, J. J. 1987. Incorporating problem specific knowledge into genetic algorithms. In Genetic Algorithms and Simulated Annealing, L. Davis, Ed. Morgan-Kaufmann, 42-60.
78. GREFENSTETTE, J. J. 1990. A user's guide to GENESIS 5.0. Tech. rep., Navy Centre for Applied Research in Artificial Intelligence, Washington, D.C.
79. HANSEN, P. 1986. The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization. Capri, Italy.
80. HANSEN, P. AND MLADENOVIĆ, N. 1997. Variable neighborhood search for the p-median. Loc. Sci. 5, 207-226.
81. HANSEN, P. AND MLADENOVIĆ, N. 1999. An introduction to variable neighborhood search. In Metaheuristics: Advances and trends in local search paradigms for optimization, S. Voß, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic Publishers, Chapter 30, 433-458.
82. HANSEN, P. AND MLADENOVIĆ, N. 2001. Variable neighborhood search: Principles and applications. Europ. J. Oper. Res. 130, 449-467.
83. HARIK, G. 1999. Linkage learning via probabilistic modeling in the ECGA. Tech. Rep. No. 99010, IlliGAL, University of Illinois.
84. HARVEY, W. D. 1995. Nonsystematic backtracking search. Ph.D. thesis, CIRL, University of Oregon.
85. HARVEY, W. D. AND GINSBERG, M. L. 1995. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI 1995 (Montréal, Qué, Canada). C. S. Mellish, Ed. Vol. 1. Morgan-Kaufmann, 607-615.
86. HERTZ, A. AND KOBLER, D. 2000. A framework for the description of evolutionary algorithms. Europ. J. Oper. Res. 126, 1-12.
87. HOGG, T. AND HUBERMAN, A. 1993. Better than the best: The power of cooperation. In SFI 1992 Lectures in Complex Systems. Addison-Wesley, 163-184.
88. HOGG, T. AND WILLIAMS, C. 1993. Solving the really hard problems with cooperative search. In Proceedings of AAAI93. AAAI Press, 213-235.
89. HOLLAND, J. H. 1975. Adaption in natural and artificial systems. The University of Michigan Press, Ann Harbor, MI.
90. HORDIJK, W. 1996. A measure of landscapes. Evolut. Comput. 4, 4, 335-360.
91. INGBER, L. 1996. Adaptive simulated annealing (ASA): Lessons learned. Cont. Cybernet.- Special Issue on Simulated Annealing Applied to Combinatorial Optimization 25, 1, 33-54.
92. JOHNSON, D. S. AND MCGEOCH, L. A. 1997. The traveling salesman problem: a case study. In Local Search in Combinatorial Optimization, E. Aarts and J. Lenstra, Eds. Wiley, New York, 215-310.
93. JONES, T. 1995a. Evolutionary algorithms, fitness landscapes and search. Ph.D. thesis, Univ. of New Mexico, Albuquerque, NM.
94. JONES, T. 1995b. One operator, one landscape. Santa Fe Institute Tech. Rep. 95-02-025, Santa Fe Institute.
95. JOSLIN, D. E. AND CLEMENTS, D. P. 1999. "Squeaky Wheel" Optimization. J. Artif. Int. Res. 10, 353-373.
96. JUSSIEN, N. AND LHOMME, O. 2002. Local search with constraint propagation and conflict-based heuristics. Artif. Int. 139, 21-45.
97. KAUFFMAN, S. A. 1993. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press.
98. KILBY, P., PROSSER, P., AND SHAW, P. 1999. Guided Local Search for the Vehicle Routing Problem with time windows. In Meta-heuristics: Advances and trends in local search paradigms for optimization, S. Voß, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic, 473-486.
99. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science, 13 May 1983 220, 4598, 671-680.
100. LAGUNA, M., LOURENÇO, H., AND MARTÍ, R. 2000. Assigning Proctors to Exams with Scatter Search. In Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, M. Laguna and J. L. González-Velarde, Eds. Kluwer Academic Publishers, Boston, MA, 215-227.
101. LAGUNA, M. AND MARTÍ, R. 1999. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 1, 44-52.
102. LAGUNA, M., MARTÍ, R., AND CAMPOS, V. 1999. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217-1230.
103. LARRAÑAGA, P. AND LOZANO, J. A., Eds. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston, MA.
104. LOURENÇO, H. R., MARTIN, O., AND STÜTZLE, T. 2001. A beginner's introduction to Iterated Local Search. In Proceedings of MIC'2001 - Meta-heuristics International Conference. Vol. 1. Porto - Portugal, 1-6.
105. LOURENÇO, H. R., MARTIN, O., AND STÜTZLE, T. 2002. Iterated local search. In Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA, 321-353.
106. LUNDY, M. AND MEES, A. 1986. Convergence of an annealing algorithm. Math. Prog. 34, 1, 111-124.
107. MARTIN, O. AND OTTO, S. W. 1996. Combining simulated annealing with local search heuristics. Ann. Oper. Res. 63, 57-75.
108. MARTIN, O., OTTO, S. W., AND FELTEN, E. W. 1991. Large-step Markov chains for the traveling salesman problem. Complex Syst. 5, 3, 299-326.
109. MERKLE, D., MIDDENDORF, M., AND SCHMECK, H. 2002. Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evolut. Comput. 6, 4, 333-346.
110. METAHEURISTICS NETWORK WEBSITE 2000. http://www.metaheuristics.net/. Visited in January 2003.
111. MEULEAU, N. AND DORIGO, M. 2002. Ant colony optimization and stochastic gradient descent. Artif. Life 8, 2, 103-121.
112. MICHALEWICZ, Z. AND MICHALEWICZ, M. 1997. Evolutionary computation techniques and their applications. In Proceedings of the IEEE International Conference on Intelligent Processing Systems, (Beijing, China). Institute of Electrical & Electronics Engineers, Incorporated, 14-24.
113. MILANO, M. AND ROLI, A. 2002. On the relation between complete and incomplete search: An informal discussion. In Proceedings of CP-AI-OR'02 - Fourth Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (Le Croisic, France). 237-250.
114. MILLS, P. AND TSANG, E. 2000. Guided local search for solving SAT and weighted MAX-SAT Problems. In SAT2000, I. Gent, H. van Maaren, and T. Walsh, Eds. IOS Press, 89-106.
115. MITCHELL, M. 1998. An Introduction to Genetic Algorithms. MIT press, Cambridge, MA.
116. MLADENOVIĆ, N. AND UROŠEVIĆ, D. 2001. Variable neighborhood search for the k-cardinality tree. In Proceedings of MIC'2001 - Meta-heuristics International Conference. Vol. 2. Porto, Portugal, 743-747.
117. MOSCATO, P. 1989. On evolution, search, optimization, genetic algorithms and martial arts: Toward memetic algorithms. Tech. Rep. Caltech Concurrent Computation Program 826, California Institute of Technology, Pasadena, Calif.
118. MOSCATO, P. 1999. Memetic algorithms: A short introduction. In New Ideas in Optimization, F. G. D. Corne and M. Dorigo, Eds. McGraw-Hill.
119. MÜHLENBEIN, H. 1991. Evolution in time and space - The parallel genetic algorithm. In Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. Morgan-Kaufmann, San Mateo, Calif.
120. MÜHLENBEIN, H. AND PAAß, G. 1996. From recombination of genes to the estimation of distributions. In Proceedings of the 4th Conference on Parallel Problem Solving from Nature - PPSN IV, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Lecture Notes in Computer Science, vol. 1411. Springer, Berlin, 178-187.
121. MÜHLENBEIN, H. AND VOIGT, H.-M. 1995. Gene pool recombination in genetic algorithms. In Proc. of the Metaheuristics Conference, I. H. Osman and J. P. Kelly, Eds. Kluwer Academic Publishers, Norwell, USA.
122. NEMHAUSER, G. L. AND WOLSEY, A. L. 1988. Integer and Combinatorial Optimization. Wiley, New York.
123. NOWICKI, E. AND SMUTNICKI, C. 1996. A fast taboo search algorithm for the job-shop problem. Manage. Sci. 42, 2, 797-813.
124. OSMAN, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421-451.
125. OSMAN, I.H. AND LAPORTE, G. 1996. Metaheuristics: A bibliography. Ann. Oper. Res. 63, 513-623
126. PAPADIMITRIOU, C. H. AND STEIGLITZ, K. 1982. Combinatorial Optimization - Algorithms and Complexity, Dover Publications, Inc., New York.
127. PELIKAN, M., GOLDBERG, D. E., AND CANTÚ-PAZ, E. 1999a. BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99 (Orlando, Fla.). W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and B. E. Smith, Eds. Vol. I Morgan-Kaufmann Publishers, San Fransisco, CA, 525-532.
128. PELIKAN, M., GOLDBERG, D. E., AND LOBO, F. 1999b. A survey of optimization by building and using probabilistic models. Tech. Rep. No. 99018, IlliGAL, University of Illinois.
129. PESANT, G. AND GENDREAU, M. 1996. A view of local search in Constraint Programming. In Principles and Practice of Constraint Programming - CP'96. Lecture Notes in Computer Science, vol. 1118. Springer-Verlag, 353-366.
130. PESANT, G. AND GENDREAU, M. 1999. A constraint programming framework for local search methods. J. Heuristics 5, 255-279.
131. PITSOULIS, L. S. AND RESENDE, M. G. C. 2002. Greedy randomized adaptive search procedure. In Handbook of Applied Optimization, P. Pardalos and M. Resende, Eds. Oxford University Press, 168-183.
132. PRAIS, M. AND RIBEIRO, C. C. 2000. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164-176.
133. PRESTWICH, S. 2002. Combining the scalability of local search with the pruning techniques of systematic search. Ann. Oper. Res. 115, 51-72.
134. RADCLIFFE, N. J. 1991. Forma Analysis and Random Respectful Recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, ICGA 1991. Morgan-Kaufmann, San Mateo, Calif., 222-229.
135. RAYWARD-SMITH, V. J. 1994. A unified approach to tabu search, simulated annealing and genetic algorithms. In Applications of Modern Heuristics, V. J. Rayward-Smith, Ed. Alfred Waller Limited, Publishers.
136. RECHENBERG, I. 1973. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog.
137. REEVES, C. R., Ed. 1993. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, Oxford, England.
138. REEVES, C. R. 1999. Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473-490.
139. REEVES, C. R. AND ROWE, J. E. 2002. Genetic Algorithms: Principles and Perspectives. A Guide to GA Theory. Kluwer Academic Publishers, Boston (USA).
140. REGO, C. 1998. Relaxed Tours and Path Ejections for the Traveling Salesman Problem. Europ. J. Oper. Res. 106, 522-538.
141. REGO, C. 2001. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Paral. Comput. 27, 3, 201-222.
142. RESENDE, M. G. C. AND RIBEIRO, C. C. 1997. A GRASP for graph planarization. Networks 29, 173-189.
143. RIBEIRO, C. C. AND SOUZA, M. C. 2002. Variable neighborhood search for the degree constrained minimum spanning tree problem. Disc. Appl. Math. 118, 43-54.
144. SCHAERF, A. 1997. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, IJCAI 1997. Morgan-Kaufmann Publishers, San Mateo, CA, 1254-1259.
145. SCHAERF, A., CADOLI, M., AND LENZERINI, M. 2000. LOCAL++: a C++ framework for local search algorithms. Softw. Pract. Exp. 30, 3, 233-256.
146. SHAW, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In Principle and Practice of Constraint Programming - CP98, M. Maher and J.-F. Puget, Eds. Lecture Notes in Computer Science, vol. 1520. Springer.
147. SIPPER, M., SANCHEZ, E., MANGE, D., TOMASSINI, M., PÉREZ-URIBE, A., AND STAUFFER, A. 1997. A phylogenetic, ontogenetic, and epigenetic view of bio-inspired hardware systems. IEEE Trans. Evolut. Comput. 1, 1, 83-97.
148. SONDERGELD, L. AND Voß, S. 1999. Cooperative intelligent search using adaptive memory techniques. In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic Publishers, Chapter 21, 297-312.
149. SPEARS, W. M., JONG, K. A. D., BÄCK, T., FOGEL, D. B., AND DE GARIS, H. 1993. An overview of evolutionary computation. In Proceedings of the European Conference on Machine Learning (ECML-93), P. B. Brazdil, Ed. Vol. 667. Springer Verlag, Vienna, Austria, 442-459.
150. STADLER, P. F. 1995. Towards a theory of landscapes. In Complex Systems and Binary Networks, R. Lopéz-Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertuche, Eds. Lecture Notes in Physics, vol. 461. Springer-Verlag, Berlin, New York, 77-163. Also available as SFI preprint 95-03-030.
151. STADLER, P. F. 1996. Landscapes and their correlation functions. J. Math. Chem. 20, 1-45. Also available as SFI preprint 95-07-067.
152. STÜTZLE, T. 1999a. Iterated local search for the quadratic assignment problem. Tech. rep. aida-99-03, FG Intellektik, TU Darmstadt.
153. STÜTZLE, T. 1999b. Local Search Algorithms for Combinatorial Problems - Analysis, Algorithms and New Applications. DISKI - Dissertationen zur Künstliken Intelligenz, infix, Sankt Augustin, Germany.
154. STÜTZLE, T. AND HOOS, H. H. 2000. MAX-MIN Ant System. Fut. Gen. Comput. Syst. 16, 8, 889-914.
155. SYSWERDA, G. 1993. Simulated Crossover in Genetic Algorithms. In Proceedings of the 2nd Workshop on Foundations of Genetic Algorithms, L. Whitley, Ed. Morgan-Kaufmann Publishers, San Mateo, Calif., 239-255.
156. TABU SEARCH WEBSITE. 2003. http://www.tabusearch.net. Visited in January 2003.
157. TAILLARD, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. Paral. Comput. 17, 443-455.
158. TALBI, E.-G. 2002. A Taxonomy of Hybrid Metaheuristics. Journal of Heuristics 8, 5, 541-564.
159. TOULOUSE, M., CRAINIC, T., AND SANSÓ, B. 1999a. An experimental study of the systemic behavior of cooperative search algorithms. In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voß, S. Martello, I. Osman, and C. Roucairol, Eds. Kluwer Academic Publishers, Chapter 26, 373-392.
160. TOULOUSE, M., THULASIRAMAN, K., AND GLOVER, F. 1999b. Multi-level cooperative search: A new paradigm for combinatorial optimization and application to graph partitioning. In Proceedings of the 5th International Euro-Par Conference on Parallel Processing. Lecture Notes in Computer Science. Springer-Verlag, New York, 533-542.
161. VAN KEMENADE, C. H. M. 1996. Explicit filtering of building blocks for genetic algorithms. In Proceedings of the 4th Conference on Parallel Problem Solving from Nature - PPSN IV, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Lecture Notes in Computer Science, vol. 1141. Springer, Berlin, 494-503.
162. VAN LAARHOVEN, P. J. M., AARTS, E. H. L., AND LENSTRA, J.K. 1992. Job Shop Scheduling by Simulated Annealing. Oper. Res. 40, 113-125.
163. VOSE, M. 1999. The Simple Genetic Algorithm: Foundations and Theory. Complex Adaptive Systems. MIT Press.
164. VOß, S., MARTELLO, S., OSMAN, I. H., AND ROUCAIROL, C., Eds. 1999. Meta-Heuristics - Advances and Trend's in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands.
165. VOß, S. AND WOODRUFF, D., Eds. 2002. Optimization Software Class Libraries. Kluwer Academic Publishers, Dordrecht, The Netherlands.
166. VOUDOURIS, C. 1997. Guided local search for combinatorial optimization problems. Ph.D. dissertation, Department of Computer Science, University of Essex, pp. 166.
167. VOUDOURIS, C. AND TSANG, E. 1999. Guided local search. Europ. J. Oper. Res. 113, 2, 469-499.
168. WADE, A. S. AND RAYWARD-SMITH, V. J. 1997. Effective local search for the steiner tree problem. Studies in Locational Analysis 11, 219-241. Also in Advances in Steiner Trees, ed. by Ding-Zhu Du, J. M.Smith and J.H. Rubinstein, Kluwer, 2000.
169. WADE, A. S. AND RAYWARD-SMITH, V. J. 1997. Effective local search for the steiner tree problem. Studies in Locational Analysis 11, 219-241. Also in Advances in Steiner Trees, ed. by Ding-Zhu Du, J. M.Smith and J.H. Rubinstein, Kluwer, 2000.
170. WATSON, R. A., HORNBY, G. S., AND POLLACK, J. B. 1998. Modeling building-block interdependence In Late Breaking Papers at the Genetic Programming 1998 Conference, J. R. Koza, Ed. Stanford University Bookstore, University of Wisconsin, Madison, Wisconsin, USA.
171. WHITLEY, D. 1989. The GENITOR algorithm and selective pressure: Why rank-baaed allocation of reproductive trials is best. In Proceedings of the 3rd International Conference on Genetic Algorithms, ICGA 1989. Morgan-Kaufmann Publishers, 116-121.
172. YAGIURA, M. AND IBARAKI, T. 2001. On metaheuristic algorithms for combinatorial optimization problems. Syst. Comput. Japan 32, 3, 33-55.
173. ZLOCHIN, M., BIRATTARI, M., MEULEAU, N., AND DORIGO, M. 2004. Model-based search for combinatorial optimization: A critical survey. Ann. Oper. Res. To appear.