Abstract
Metaheuristics support managers in decision making with robust tools providing high quality solutions to important problems in business, engineering, economics and science in reasonable time horizons. While finding exact solutions in these applications still poses a real challenge despite the impact of recent advances in computer technology and the great interactions between computer science, management science/operations research and mathematics, (meta-) heuristics still seem to be the methods of choice in many (not to say most) applications. In this chapter we give some insight into the state of the art of metaheuristics. It focuses on the significant progress regarding the methods themselves as well as the advances regarding their interplay and hybridization with exact methods.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E.H.L. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. Wiley, Chichester, 1997.
E.H.L. Aarts and M. Verhoeven. Local search. In M. Dell’Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 163–180. Wiley, Chichester, 1997.
T. Achterberg and T. Berthold. Improving the feasibility pump. Discrete Optimization, 4:77–86, 2007.
B. Adenso-Diaz and M. Laguna. Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research, 54:99–114, 2006.
R.K. Ahuja, O. Ergun, J.B. Orlin, and A.B. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123:75–102, 2002.
E. Alba, editor. Parallel Metaheuristics. Wiley, Hoboken, 2005.
E. Alba and R. Marti, editors. Metaheuristic Procedures for Training Neural Networks. Springer, New York, 2006.
I. Althöfer and K.-U. Koschnick. On the convergence of ‘threshold accepting’. Applied Mathematics and Optimization, 24:183–195, 1991.
T. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, 1997.
R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1:9–32, 1995.
M.B. Bastos and C.C. Ribeiro. Reactive tabu search with path relinking for the Steiner problem in graphs. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 39–58. Kluwer, Boston, 2002.
R. Battiti. Machine learning methods for parameter tuning in heuristics. Position paper for the 5th DIMACS Challenge Workshop: Experimental Methodology Day, 1996.
R. Battiti. Reactive search: Toward self-tuning heuristics. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 61–83. Wiley, Chichester, 1996.
R. Battiti, M. Brunato, and F. Mascia. Reactive Search and Intelligent Optimization. Springer, New York, 2009.
R. Battiti and G. Tecchiolli. The reactive tabu search. ORSA Journal on Computing, pages 126–140, 1994.
L. Bertacco, M. Fischetti, and A. Lodi. A feasibility pump heuristic for general mixed integer problems. Discrete Optimization, 4(1):77–86, 2007.
D.P. Bertsekas, J.N. Tsitsiklis, and C. Wu. Rollout algorithms for combinatorial optimization. Journal of Heuristics, 3:245–262, 1997.
C. Bierwirth, D.C. Mattfeld, and J.P. Watson. Landscape regularity and random walks for the job-shop scheduling problem. In J. Gottlieb and G.R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, volume 3004 of Lecture Notes in Computer Science, pages 21–30. Springer, 2004.
C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35:268–308, 2003.
E.K. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In F.W. Glover and G.A. Kochenberger, editors, Handbook of Metaheuristics, pages 457–474. Kluwer, Boston, 2003.
M. Caserta and E. Quiñonez Rico. A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot sizing problem with setup times. Computers & Operations Research, 36(2):530–548, 2009.
R. Cerulli, A. Fink, M. Gentili, and S. Voß. Extensions of the minimum labelling spanning tree problem. Journal of Telecommunications and Information Technology, 4/2006:39–45, 2006.
I. Charon and O. Hudry. The noising method: A new method for combinatorial optimization. Operations Research Letters, 14:133–137, 1993.
C. Cotta and A. Fernández. Analyzing fitness landscapes for the optimal golomb ruler problem. In G.R. Raidl and J. Gottlieb, editors, Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, volume 3448 of Lecture Notes in Computer Science, pages 68–79. Springer, 2005.
S. P. Coy, B.L. Golden, G.C. Rungen, and E.A. Wasil. Using experimental design to find effective parameter settings for heuristics. Journal of Heuristics, 7:77–97, 2000.
T.G. Crainic, M. Toulouse, and M. Gendreau. Toward a taxonomy of parallel tabu search heuristics. INFORMS Journal on Computing, 9:61–72, 1997.
E. Danna, E. Rothberg, and C. Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming A, 102:71–90, 2005.
P. De Boer, D.P. Kroese, S. Mannor, and R.Y. Rubinstein. A tutorial on the cross-entropy method. Annals of Operations Research, 134:19–67, 2005.
J. Dems̆sar. Statistical comparison of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1–30, 2006.
L. Di Gaspero and A. Schaerf. EASYLOCAL++: An object-oriented framework for the flexible design of local-search algorithms. Software – Practice and Experience, 33:733–765, 2003.
T.G. Dietterich. Approximate statistical test for comparing supervised classification learning algorithms. Neural Computation, 10(7):1895–1923, 1998.
M. Dorigo, V. Maniezzo, and A. Colorni. Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, B - 26:29–41, 1996.
M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, Cambridge, 2004.
K.F. Dörner, M. Gendreau, P. Greistorfer, W.J. Gutjahr, R.F. Hartl, and M. Reimann, editors. Metaheuristics: Progress in Complex Systems Optimization. Springer, New York, 2007.
K.A. Dowsland. Simulated annealing. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, pages 20–69. Halsted, Blackwell, 1993.
J. Dreo, A. Petrowski, P. Siarry, and E. Taillard. Metaheuristics for Hard Optimization. Springer, Berlin, 2006.
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.
C.W. Duin and S. Voß. Steiner tree heuristics - a survey. In H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms, editors, Operations Research Proceedings 1993, pages 485–496, Berlin, 1994. Springer.
C.W. Duin and S. Voß. The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34:181–191, 1999.
J. Eckstein and M. Nediak. Pivot, cut, and dive: a heuristic for 0-1 mixed integer programming. Journal of Heuristics, 13:471–503, 2007.
M. Ehrgott and X. Gandibleux. Bound sets for biobjective combinatorial optimization problems. Computers & Operations Research, 34(9):2674–2694, 2007.
U. Faigle and W. Kern. Some convergence results for probabilistic tabu search. ORSA Journal on Computing, 4:32–37, 1992.
P. Festa and M.G.C. Resende. An annotated bibliography of GRASP. Technical report, AT&T Labs Research, 2004.
G.R. Filho and L.A. Lorena. Constructive genetic algorithm and column generation: an application to graph coloring. In Proceedings of APORS 2000 - The Fifth Conference of the Association of Asian-Pacific Operations Research Society within IFORS 2000.
A. Fink and S. Voß. HotFrame: A heuristic optimization framework. In S. Voß and D.L. Woodruff, editors, Optimization Software Class Libraries, pages 81–154. Kluwer, Boston, 2002.
M. Fischetti, F. Glover, and A. Lodi. The feasibility pump. Mathematical Programming, A 104:91–104, 2005.
M. Fischetti and A. Lodi. Local branching. Mathematical Programming, B 98:23–47, 2003.
D.B. Fogel. On the philosophical differences between evolutionary algorithms and genetic algorithms. In D.B. Fogel and W. Atmar, editors, Proceedings of the Second Annual Conference on Evolutionary Programming, pages 23–29. Evolutionary Programming Society, La Jolla, 1993.
D.B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, New York, 1995.
A. M. Glenberg. Learning from Data: An Introduction to Statistical Reasoning. Lawrence Erlbaum Associates, Mahwah, New Jersey, 1996.
F. Glover. Heuristics for integer programming using surrogate constraints. Decision Sciences, 8:156–166, 1977.
F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533–549, 1986.
F. Glover. Tabu search – Part II. ORSA Journal on Computing, 2:4–32, 1990.
F. Glover. Scatter search and star-paths: beyond the genetic metaphor. OR Spektrum, 17:125–137, 1995.
F. Glover. Tabu search and adaptive memory programming – Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies, pages 1–75. Kluwer, Boston, 1997.
F. Glover and M. Laguna. General purpose heuristics for integer programming - part I. Journal of Heuristics, 2(4):343–358, 1997.
F. Glover and M. Laguna. General purpose heuristics for integer programming - part II. Journal of Heuristics, 3(2):161–179, 1997.
F. Glover and M. Laguna. Tabu Search. Kluwer, Boston, 1997.
F.W. Glover and G.A. Kochenberger, editors. Handbook of Metaheuristics. Kluwer, Boston, 2003.
D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, 1989.
B.L. Golden, S. Raghavan, and E.A. Wasil, editors. The Next Wave in Computing, Optimization, and Decision Technologies. Kluwer, Boston, 2005.
A.M. Gomes and J.F. Oliveira. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research, 171:811–829, 2006.
P. Greistorfer, A. Lokketangen, D.L. Woodruff, and S. Voß. Sequential versus simultaneous maximization of objective and diversity. Journal of Heuristics, 14:613–625, 2008.
P. Greistorfer and S. Voß. Controlled pool maintenance for meta-heuristics. In C. Rego and B. Alidaee, editors, Metaheuristic Optimization via Memory and Evolution, pages 387–424. 2005.
K. Gutenschwager, C. Niklaus, and S. Voß. Dispatching of an electric monorail system: Applying meta-heuristics to an online pickup and delivery problem. Transportation Science, 38:434–446, 2004.
B. Hajek. Cooling schedules for optimal annealing. Mathematics of Operations Research, 13:311–329, 1988.
P. Hansen, V. Maniezzo, and S. Voß. Special issue on mathematical contributions to metaheuristics editorial. Journal of Heuristics, 15(3):197–199, 2009.
P. Hansen and N. Mladenović. An introduction to variable neighborhood search. In S. Voß, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 433–458. Kluwer, Boston, 1999.
P. Hansen, N. Mladenović, and D. Perez-Brito. Variable neighborhood decomposition search. Journal of Heuristics, 7(4):335–350, 2001.
J.P. Hart and A.W. Shogan. Semi-greedy heuristics: An empirical study. Operations Research Letters, 6:107–114, 1987.
A. Hertz and D. Kobler. A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126:1–12, 2000.
F. Hoffmeister and T. Bäck. Genetic algorithms and evolution strategies: Similarities and differences. In H.-P. Schwefel and R. Männer, editors, Parallel Problem Solving from Nature, volume 496 of Lecture Notes in Computer Science, pages 455–469. Springer, 1991.
J.H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
J.N. Hooker. Testing heuristics: We have it all wrong. Journal of Heuristics, 1:33–42, 1995.
H.H. Hoos and T. Stützle. Stochastic Local Search – Foundations and Applications. Elsevier, Amsterdam, 2005.
T. Ibaraki, K. Nonobe, and M. Yagiura, editors. Metaheuristics: Progress as Real Problem Solvers. Springer, New York, 2005.
L. Ingber. Adaptive simulated annealing (ASA): Lessons learned. Control and Cybernetics, 25:33–54, 1996.
A. Jaszkiewicz. A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Annals of Operations Research, 131:215–235, 2004.
D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part i, graph partitioning. Operations Research, 37:865–892, 1989.
S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.
M. Laguna and R. Martí. Scatter Search. Kluwer, Boston, 2003.
S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21:498–516, 1973.
C. McGeoch. Toward an experimental method for algorithm simulation. INFORMS Journal on Computing, 8:1–15, 1996.
C. Meloni, D. Pacciarelli, and M. Pranzo. A rollout metaheuristic for job shop scheduling problems. Annals of Operations Research, 131:215–235, 2004.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, 3 edition, 1999.
Z. Michalewicz and D.B. Fogel. How to Solve It: Modern Heuristics. Springer, Berlin, 2 edition, 2004.
P. Moscato. An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search. Annals of Operations Research, 41:85–121, 1993.
I.H. Osman and J.P. Kelly, editors. Meta-Heuristics: Theory and Applications. Kluwer, Boston, 1996.
M.W. Park and Y.D. Kim. A systematic procedure for setting parameters in simulated annealing algorithms. Computers & Operations Research, 25(3):207–217, 1998.
R. Parson and M.E. Johnson. A case study in experimental design applied to genetic algorithms with applications to DNA sequence assembly. American Journal of Mathematical and Management Sciences, 17(3):369–396, 1997.
J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, 1984.
Pesch and F. Glover. TSP ejection chains. Discrete Applied Mathematics, 76:165–182, 1997.
G. Polya. How to solve it. Princeton University Press, Princeton, 1945.
J. Puchinger and G.R. Raidl. An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. In X. Yao, E.K. Burke, J.A. Lozano, J. Smith, J.J. Merelo-Guervos, J.A. Bullinaria, J.E. Rowe, P. Tino, A. Kaban, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature – PPSN VIII, volume 3242 of Lecture Notes in Computer Science, pages 642–651. Springer Verlag, 2004.
J. Puchinger and G.R. Raidl. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In J. Mira and J.R. Álvarez, editors, Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of Lecture Notes in Computer Science, pages 41–53. Springer, 2005.
G.R. Raidl. A unified view on hybrid metaheuristics. In F. Almeida, M.J. Blesa, C. Blum, J.M. Moreno-Vega, M.M. Pérez, A. Roli, and M. Sampels, editors, Hybrid Metaheuristics, volume 4030 of Lecture Notes in Computer Science, pages 1–12. Springer, 2006.
B. Rangaswamy, A. S. Jain, and F. Glover. Tabu search candidate list strategies in scheduling. pages 215–233, 1998.
V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors. Modern Heuristic Search Methods. Wiley, Chichester, 1996.
C.R. Reeves and J.E. Rowe. Genetic Algorithms: Principles and Perspectives. Kluwer, Boston, 2002.
C. Rego and B. Alidaee, editors. Metaheuristic Optimization via Memory and Evolution. 2005.
M.G.C. Resende and J.P. de Sousa, editors. Metaheuristics: Computer Decision-Making. Kluwer, Boston, 2004.
C.C. Ribeiro and P. Hansen, editors. Essays and Surveys in Metaheuristics. Kluwer, Boston, 2002.
F. Rossi, P. van Beek, and T. Walsh, editors. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier, 2006.
R.Y. Rubinstein. Optimization of Computer Simulation Models with Rare Events. European Journal of Operational Research, 99:89–112, 1997.
M. Sakawa. Genetic Algorithms and Fuzzy Multiobjective Optimization. Kluwer, Boston, 2001.
H.-P. Schwefel and T. Bäck. Artificial evolution: How and why? In D. Quagliarella, J. Périaux, C. Poloni, and G. Winter, editors, Genetic Algorithms and Evolution Strategy in Engineering and Computer Science: Recent Advances and Industrial Applications, pages 1–19. Wiley, Chichester, 1998.
P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. Working paper, ILOG S.A., Gentilly, France, 1998.
K. Smith. Neural networks for combinatorial optimisation: A review of more than a decade of research. INFORMS Journal on Computing, 11:15–34, 1999.
M. Sniedovich and S. Voß. The corridor method: A dynamic programming inspired metaheuristic. Control and Cybernetics, 35:551–578, 2006.
L. Sondergeld. Performance Analysis Methods for Heuristic Search Optimization with an Application to Cooperative Agent Algorithms. Shaker, Aachen, 2001.
R.H. Storer, S.D. Wu, and R. Vaccari. Problem and heuristic space search strategies for job shop scheduling. ORSA Journal on Computing, 7:453–467, 1995.
E. Taillard and S. Voß. POPMUSIC – partial optimization metaheuristic under special intensification conditions. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 613–629. Kluwer, Boston, 2002.
E. Taillard, P. Waelti, and J. Zuber. Few statistical tests for proportions comparison. European Journal of Operational Research, 185(3):1336–1350, 2006.
É.D. Taillard, L.M. Gambardella, M. Gendreau, and J.-Y. Potvin. Adaptive memory programming: A unified view of meta-heuristics. European Journal of Operational Research, 135:1–16, 2001.
J. Tavares, F. Pereira, and E. Costa. Multidimensional knapsack problem: A fitness landscape analysis. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cynernetics, 38(3):604–616, 2008.
R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. A local search template. Computers & Operations Research, 25:969–979, 1998.
M.G.A. Verhoeven and E.H.L. Aarts. Parallel local search techniques. Journal of Heuristics, 1:43–65, 1995.
S. Voß. Intelligent Search. Manuscript, TU Darmstadt, 1993.
S. Voß. Tabu search: applications and prospects. In D.-Z. Du and P. Pardalos, editors, Network Optimization Problems, pages 333–353. World Scientific, Singapore, 1993.
S. Voß. Observing logical interdependencies in tabu search: Methods and results. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 41–59, Chichester, 1996. Wiley.
S. Voß. Meta-heuristics: The state of the art. In A. Nareyek, editor, Local Search for Planning and Scheduling, volume 2148 of Lecture Notes in Artificial Intelligence, pages 1–23. Springer, 2001.
S. Voß. Metaheuristics. In C.A. Floudas and P.M. Pardalos, editors, Encyclopedia of Optimization. Springer, New York, 2008.
S. Voß, A. Fink, and C. Duin. Looking ahead with the pilot method. Annals of Operations Research, 136:285–302, 2005.
S. Voß, S. Martello, I.H Osman, and C. Roucairol, editors. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston, 1999.
S. Voß and D.L. Woodruff, editors. Optimization Software Class Libraries. Kluwer, Boston, 2002.
J. P. Watson, L. D. Whitley, and A. E. Howe. Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. Journal of Artificial Intelligence Research, 24:221–261, 2005.
D. Whitley, S. Rana, J. Dzubera, and K.E. Mathias. Evaluating evolutionary algorithms. Artificial Intelligence, 85:245–276, 1996.
D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1:67–82, 1997.
D.L. Woodruff. Proposals for chunking and tabu search. European Journal of Operational Research, 106:585–598, 1998.
D.L. Woodruff. A chunking based selection strategy for integrating meta-heuristics with branch and bound. In S. Voß, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 499–511. Kluwer, Boston, 1999.
J. Xu, S.Y. Chiu, and F. Glover. Fine-tuning a tabu search algorithm with statistical tests. International Transactions in Operational Research, 5(3):233–244, 1998.
J.H. Zar. Biostatistical Analysis. Prentice Hall, Upper Saddle River, New Jersey, 1999.
M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo. Model-based search for combinatorial optimization. Annals of Operations Research, 131(1):373–395, 2004.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Caserta, M., Voß, S. (2009). Metaheuristics: Intelligent Problem Solving. In: Maniezzo, V., Stützle, T., Voß, S. (eds) Matheuristics. Annals of Information Systems, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1306-7_1
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1306-7_1
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1305-0
Online ISBN: 978-1-4419-1306-7
eBook Packages: Business and EconomicsBusiness and Management (R0)