Christian Blum
Andrea Roli
Skip Abstract Section
Abstract
The field of metaheuristics for the application to combinatorial optimization problems is a rapidly growing field of research. This is due to the importance of combinatorial optimization problems for the scientific as well as the industrial world. We give a survey of the nowadays most important metaheuristics from a conceptual point of view. We outline the different components and concepts that are used in the different metaheuristics in order to analyze their similarities and differences. Two very important concepts in metaheuristics are intensification and diversification. These are the two forces that largely determine the behavior of a metaheuristic. They are in some way contrary but also complementary to each other. We introduce a framework, that we call the I&D frame, in order to put different intensification and diversification components into relation with each other. Outlining the advantages and disadvantages of different metaheuristic approaches we conclude by pointing out the importance of hybridization of metaheuristics as well as the integration of metaheuristics and other methods for optimization.
- 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.]]Google Scholar
- Aarts, E. H. L. and Lenstra, J. K., Eds. 1997. Local Search in Combinatorial Optimization. Wiley, Chichester, UK.]] Google ScholarDigital Library
- Aiex, R. M., Binato, S., and Resende, M. G. C. 2003. Parallel GRASP with path-relinking for job shop scheduling. Paral. Comput. To appear.]] Google ScholarDigital Library
- Bachelet, V. and Talbi, E. 2000. Cosearch: A co-evolutionary metaheuritics. In Proceedings of Congress on Evolutionary Computation---CEC'2000. 1550--1557.]]Google Scholar
- Bäck, T. 1996. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York.]] Google ScholarDigital Library
- Bäck, T., Fogel, D. B., and Machalewicz, Z., Eds. 1997. Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol, UK.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Bar-Yam, Y. 1997. Dynamics of Complex Systems. Studies in nonlinearity. Addison--Wesley, Reading, Mass.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Battiti, R. and Protasi, M. 1997. Reactive Search, A history-base heuristic for MAX-SAT. ACM J. Exper. Algor. 2, Article 2.]] Google ScholarDigital Library
- Battiti, R. and Tecchiolli, G. 1994. The reactive tabu search. ORSA J. Comput. 6, 2, 126--140.]]Google ScholarCross Ref
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Blum, C., Roli, A., and Dorigo, M. 2001. HC--ACO: The hyper-cube framework for ant colony optimization. In Proceedings of MIC'2001---Meta--heuristics International Conference. Vol. 2. Porto, Portugal, 399--403.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Cerny, V. 1985. A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45, 41--51.]]Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- Coello Coello, C. A. 2000. An updated survey of GA-based multiobjective optimization techniques. ACM Comput. Surv. 32, 2, 109--143.]] Google ScholarDigital Library
- Connolly, D. T. 1990. An improved annealing scheme for the QAP. Europ. J. Oper. Res. 46, 93--100.]]Google ScholarCross Ref
- Crainic, T. G. and Toulouse, M. 2002a. Introduction to the special issue on parallel meta-heuristics. J. Heuristics 8, 3, 247--249.]] Google ScholarDigital Library
- 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.]]Google Scholar
- De Backer, B., Furnon, V., and Shaw, P. 2000. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. J. Heuristics 6, 501--523.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- 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.]]Google Scholar
- Devaney, R. L. 1989. An introduction to chaotic dynamical systems, second ed. Addison--Wesley, Reading, Mass.]]Google Scholar
- Di Caro, G. and Dorigo, M. 1998. AntNet: Distributed stigmergetic control for communication networks. J. Artif. Int. Res. 9, 317--365.]]Google ScholarDigital Library
- Dorigo, M. 1992. Optimization, learning and natural algorithms (in italian). Ph.D. thesis, DEI, Politecnico di Milano, Italy. pp. 140.]]Google Scholar
- 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.]] Google ScholarDigital Library
- Dorigo, M., Di Caro, G., and Gambardella, L. M. 1999. Ant algorithms for discrete optimization. Art. Life 5, 2, 137--172.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 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.]]Google Scholar
- Dorigo, M. and Stützle, T. 2003. Ant Colony Optimization. MIT Press, Boston, MA. To appear.]] Google ScholarDigital Library
- Dueck, G. 1993. New Optimization Heuristics. J. Comput. Phy. 104, 86--92.]] Google ScholarDigital Library
- Dueck, G. and Scheuer, T. 1990. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phy. 90, 161--175.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Eiben, A. E. and Schippers, C. A. 1998. On evolutionary exploration and exploitation. Fund. Inf. 35, 1--16.]] Google ScholarDigital Library
- Feller, W. 1968. An Introduction to Probability Theory and Its Applications. Wiley, New York.]]Google Scholar
- Feo, T. A. and Resende, M. G. C. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6, 109--133.]]Google ScholarCross Ref
- 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.]]Google Scholar
- Fink, A. and Voβ, S. 1999. Generic metaheuristics application to industrial engineering problems. Comput. Indust. Eng. 37, 281--284.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Fogel, D. B. 1994. An introduction to simulated evolutionary optimization. IEEE Trans. Neural Netw. 5, 1 (Jan.), 3--14.]]Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- Fogel, L. J. 1962. Toward inductive inference automata. In Proceedings of the International Federation for Information Processing Congress. Munich, 395--399.]]Google Scholar
- Fogel, L. J., Owens, A. J., and Walsh, M. J. 1966. Artificial Intelligence through Simulated Evolution. Wiley, New York.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Ginsberg, M. L. 1993. Dynamic backtracking. J. Artif. Int. Res. 1, 25--46.]]Google ScholarDigital Library
- Glover, F. 1977. Heuristics for integer programming using surrogate constraints. Dec. Sci. 8, 156--166.]]Google Scholar
- Glover, F. 1986. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533--549.]] Google ScholarDigital Library
- Glover, F. 1990. Tabu search Part II. ORSA J. Comput. 2, 1, 4--32.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Glover, F. and Laguna, M. 1997. Tabu Search. Kluwer Academic Publishers.]] Google ScholarDigital Library
- Glover, F., Laguna, M., and Martí, R. 2000. Fundamentals of scatter search and path relinking. Control, 29, 3, 653--684.]]Google Scholar
- 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.]]Google Scholar
- Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- Gomes, C. P., Selman, B., Crato, N., and Kautz, H. 2000. Heavy-Tayled phenomena in Satisfiability and Constraint Satisfaction Problems. J. Automat. Reason. 24, 67--100.]] Google ScholarDigital Library
- Grefenstette, J. J. 1987. Incorporating problem specific knowledge into genetic algorithms. In Genetic Algorithms and Simulated Annealing, L. Davis, Ed. Morgan-Kaufmann, 42--60.]]Google Scholar
- 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.]]Google Scholar
- Hansen, P. 1986. The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization. Capri, Italy.]]Google Scholar
- Hansen, P. and Mladenović, N. 1997. Variable neighborhood search for the p-median. Loc. Sci. 5, 207--226.]]Google ScholarCross Ref
- Hansen, P. and Mladenović, N. 1999. An introduction to variable neighborhood search. 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 30, 433--458.]]Google Scholar
- Hansen, P. and Mladenović, N. 2001. Variable neighborhood search: Principles and applications. Europ. J. Oper. Res. 130, 449--467.]]Google ScholarCross Ref
- Harik, G. 1999. Linkage learning via probabilistic modeling in the ECGA. Tech. Rep. No. 99010, IlliGAL, University of Illinois.]]Google Scholar
- Harvey, W. D. 1995. Nonsystematic backtracking search. Ph.D. thesis, CIRL, University of Oregon.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Hertz, A. and Kobler, D. 2000. A framework for the description of evolutionary algorithms. Europ. J. Oper. Res. 126, 1--12.]]Google ScholarCross Ref
- 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.]]Google Scholar
- Hogg, T. and Williams, C. 1993. Solving the really hard problems with cooperative search. In Proceedings of AAAI93. AAAI Press, 213--235.]]Google Scholar
- Holland, J. H. 1975. Adaption in natural and artificial systems. The University of Michigan Press, Ann Harbor, MI.]] Google ScholarDigital Library
- Hordijk, W. 1996. A measure of landscapes. Evolut. Comput. 4, 4, 335--360.]]Google ScholarDigital Library
- Ingber, L. 1996. Adaptive simulated annealing (ASA): Lessons learned. Cont. Cybernet.---Special Issue on Simulated Annealing Applied to Combinatorial Optimization 25, 1, 33--54.]]Google Scholar
- 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.]]Google Scholar
- Jones, T. 1995a. Evolutionary algorithms, fitness landscapes and search. Ph.D. thesis, Univ. of New Mexico, Albuquerque, NM.]]Google Scholar
- Jones, T. 1995b. One operator, one landscape. Santa Fe Institute Tech. Rep. 95-02-025, Santa Fe Institute.]]Google Scholar
- Joslin, D. E. and Clements, D. P. 1999. "Squeaky Wheel" Optimization. J. Artif. Int. Res. 10, 353--373.]]Google ScholarDigital Library
- Jussien, N. and Lhomme, O. 2002. Local search with constraint propagation and conflict-based heuristics. Artif. Int. 139, 21--45.]] Google ScholarDigital Library
- Kauffman, S. A. 1993. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press.]]Google Scholar
- 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.]]Google Scholar
- Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. 1983. Optimization by simulated annealing. Science, 13 May 1983 220, 4598, 671--680.]]Google Scholar
- 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.]]Google Scholar
- Laguna, M. and Martí, R. 1999. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 1, 44--52.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Larrañaga, P. and Lozano, J. A., Eds. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston, MA.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Lundy, M. and Mees, A. 1986. Convergence of an annealing algorithm. Math. Prog. 34, 1, 111--124.]] Google ScholarDigital Library
- Martin, O. and Otto, S. W. 1996. Combining simulated annealing with local search heuristics. Ann. Oper. Res. 63, 57--75.]]Google ScholarCross Ref
- 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.]]Google Scholar
- Merkle, D., Middendorf, M., and Schmeck, H. 2002. Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evolut. Comput. 6, 4, 333--346.]]Google ScholarDigital Library
- Metaheuristics Network Website 2000. http://www.metaheuristics.net/. Visited in January 2003.]]Google Scholar
- Meuleau, N. and Dorigo, M. 2002. Ant colony optimization and stochastic gradient descent. Artif. Life 8, 2, 103--121.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Mitchell, M. 1998. An Introduction to Genetic Algorithms. MIT press, Cambridge, MA.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google Scholar
- Moscato, P. 1999. Memetic algorithms: A short introduction. In New Ideas in Optimization, F. G. D. Corne and M. Dorigo, Eds. McGraw-Hill.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Nemhauser, G. L. and Wolsey, A. L. 1988. Integer and Combinatorial Optimization. Wiley, New York.]] Google ScholarDigital Library
- Nowicki, E. and Smutnicki, C. 1996. A fast taboo search algorithm for the job-shop problem. Manage. Sci. 42, 2, 797--813.]]Google ScholarDigital Library
- Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421--451.]] Google ScholarCross Ref
- Osman, I. H. and Laporte, G. 1996. Metaheuristics: A bibliography. Ann. Oper. Res. 63, 513--623.]]Google ScholarCross Ref
- Papadimitriou, C. H. and Steiglitz, K. 1982. Combinatorial Optimization---Algorithms and Complexity. Dover Publications, Inc., New York.]] Google ScholarDigital Library
- 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 R. E. Smith, Eds. Vol. I. Morgan-Kaufmann Publishers, San Fransisco, CA, 525--532.]]Google Scholar
- 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.]]Google Scholar
- 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.]]Google Scholar
- Pesant, G. and Gendreau, M. 1999. A constraint programming framework for local search methods. J. Heuristics 5, 255--279.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]]Google ScholarCross Ref
- Prestwich, S. 2002. Combining the scalability of local search with the pruning techniques of systematic search. Ann. Oper. Res. 115, 51--72.]]Google ScholarCross Ref
- 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.]]Google Scholar
- 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.]]Google Scholar
- Rechenberg, I. 1973. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog.]]Google Scholar
- Reeves, C. R., Ed. 1993. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, Oxford, England.]] Google ScholarDigital Library
- Reeves, C. R. 1999. Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473--490.]]Google ScholarCross Ref
- Reeves, C. R. and Rowe, J. E. 2002. Genetic Algorithms: Principles and Perspectives. A Guide to GA Theory. Kluwer Academic Publishers, Boston (USA).]] Google ScholarDigital Library
- Rego, C. 1998. Relaxed Tours and Path Ejections for the Traveling Salesman Problem. Europ. J. Oper. Res. 106, 522--538.]]Google ScholarCross Ref
- Rego, C. 2001. Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms. Paral. Comput. 27, 3, 201--222.]] Google ScholarDigital Library
- Resende, M. G. C. and Ribeiro, C. C. 1997. A GRASP for graph planarization. Networks 29, 173--189.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Schaerf, A., Cadoli, M., and Lenzerini, M. 2000. LOCAL++: a C++ framework for local search algorithms. Softw. Pract. Exp. 30, 3, 233--256.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- Stadler, P. F. 1996. Landscapes and their correlation functions. J. Math. Chem. 20, 1--45. Also available as SFI preprint 95-07-067.]]Google ScholarCross Ref
- Stützle, T. 1999a. Iterated local search for the quadratic assignment problem. Tech. rep. aida-99-03, FG Intellektik, TU Darmstadt.]]Google Scholar
- 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.]]Google Scholar
- Stützle, T. and Hoos, H. H. 2000. MAX-MIN Ant System. Fut. Gen. Comput. Syst. 16, 8, 889--914.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- Tabu Search Website. 2003. http://www.tabusearch.net. Visited in January 2003.]]Google Scholar
- Taillard, E. 1991. Robust Taboo Search for the Quadratic Assignment Problem. Paral. Comput. 17, 443--455.]]Google ScholarDigital Library
- Talbi, E.-G. 2002. A Taxonomy of Hybrid Metaheuristics. Journal of Heuristics 8, 5, 541--564.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- Vose, M. 1999. The Simple Genetic Algorithm: Foundations and Theory. Complex Adaptive Systems. MIT Press.]] Google ScholarDigital Library
- Voβ, S., Martello, S., Osman, I. H., and Roucairol, C., Eds. 1999. Meta-Heuristics---Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands.]]Google Scholar
- Voβ, S. and Woodruff, D., Eds. 2002. Optimization Software Class Libraries. Kluwer Academic Publishers, Dordrecht, The Netherlands.]]Google Scholar
- Voudouris, C. 1997. Guided local search for combinatorial optimization problems. Ph.D. dissertation, Department of Computer Science, University of Essex. pp. 166.]]Google Scholar
- Voudouris, C. and Tsang, E. 1999. Guided local search. Europ. J. Oper. Res. 113, 2, 469--499.]]Google ScholarCross Ref
- 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.]]Google Scholar
- Watson, R. A., Hornby, G. S., and Pollack, J. B. 1998. Modeling building-block interdependency. In Late Breaking Papers at the Genetic Programming 1998 Conference, J. R. Koza, Ed. Stanford University Bookstore, University of Wisconsin, Madison, Wisconsin, USA.]]Google Scholar
- Whitley, D. 1989. The GENITOR algorithm and selective pressure: Why rank-based allocation of reproductive trials is best. In Proceedings of the 3rd International Conference on Genetic Algorithms, ICGA 1989. Morgan-Kaufmann Publishers, 116--121.]] Google ScholarDigital Library
- Yagiura, M. and Ibaraki, T. 2001. On metaheuristic algorithms for combinatorial optimization problems. Syst. Comput. Japan 32, 3, 33--55.]]Google ScholarCross Ref
- Zlochin, M., Birattari, M., Meuleau, N., and Dorigo, M. 2004. Model-based search for combinatorial optimization: A critical survey. Ann. Oper. Res. To appear.]]Google Scholar
Index Terms
- Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Recommendations
Combinatorial Optimization Method Based on Hierarchical Structure in Solution Space
In this paper, we introduce a new concept of hierarchical structure into solution space of a combinatorial optimization problem, and develop a novel combinatorial optimization method based on the concept. The introduction of the above new hierarchical ...
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
Penguins Search Optimization Algorithm to Solve Quadratic Assignment Problem
BDCA'17: Proceedings of the 2nd international Conference on Big Data, Cloud and ApplicationsThis paper presents an application of new metaheuristics, based on the penguins hunting strategy, Penguins search optimization algorithm (PeSOA) for solving one of the most difficult NP-hard combinatorial optimization problems in discret case the ...
Comments