Skip to main content
SpringerLink
Log in

Meta-Heuristics: An Overview

  • Chapter
Meta-Heuristics

Abstract

Meta-heuristics are the most recent development in approximate search methods for solving complex optimization problems, that arise in business, commerce, engineering, industry, and many other areas. A meta-heuristic guides a subordinate heuristic using concepts derived from artificial intelligence, biological, mathematical, natural and physical sciences to improve their performance. We shall present brief overviews for the most successful meta-heuristics. The paper concludes with future directions in this growing area of research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • E.H.L. Aarts and J.K. Lenstra (1995) Local Search Algorithms, John Wiley & Sons, Chichester.

    Google Scholar 

  • E.H.L. Aarts and J. Korst (1989) Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley and Sons Chichester.

    Google Scholar 

  • R.F. Albrecht, C.R. Reeves and N.C. Steele (1993) Artificial Neural Nets and Genetic Algorithms. Proceedings of the International Conference in Innsbruck, Austria, Springer-Verlag.

    Google Scholar 

  • B.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende and W.R. Stewart (1995) Designing and reporting on computational experiments with heuristic methods, Journal of Heuristic, Forthcoming.

    Google Scholar 

  • R. Battiti and G. Tecchiolli (1995), The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization, Annals of Operational Research, 60 Forthcoming.

    Google Scholar 

  • R. Battiti and G. Tecchiolli (1994) The reactive tabu search, ORSA Journal on Computing 6, 126–140.

    Google Scholar 

  • R. Battiti and G. Techiolli (1992) Parallel biased search for combinatorial optimization: genetic algorithms and tabu, Microprocessors and Microsystems 16, 351–367.

    Article  Google Scholar 

  • R.K. Belew and L.B Booker (1991) Proceedings of the Fourth International Conference on Genetic Algorithms Morgan Kaufmann Publishers, San Mateo, CA.

    Google Scholar 

  • L.I. Burke and J.P. Ignizio (1992) Neural networks and operations research: an overview, Computers & Operations Research, 19, 179–189.

    Article  Google Scholar 

  • V. Cerny (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulated annealing algorithm, Journal of Optimization Theory and Applications 45, 41–51.

    Article  Google Scholar 

  • I. Charon and O. Hurdy (1993) The noisy method: a new method for combinatorial optimization, Operations Research Letters, 14, 133–137.

    Article  Google Scholar 

  • W.-C Chiang and R.A. Russell (1995) simulated annealing metaheuristics for the vehicle routing problems with time windows, Annals of Operations Research, 60, Forthcoming.

    Google Scholar 

  • N.E. Collins, R.W. Eglese, and B.L. Golden (1988) Simulated annealing — An annotated bibliography, American Journal of Mathematical and Management Sciences, 9, 209–307.

    Google Scholar 

  • S.A. Cook (1971) The complexity of theorem-proving procedures, in: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, 151–158.

    Google Scholar 

  • F. Dammeyer and S. Voss (1993) Dynamic tabu list management using the reverse elimination method, Annals of Operations Research, 41, 29–46.

    Article  Google Scholar 

  • L. Davis (1991) Handbooks of Genetic Algorithms, Van Nostrand ReinHold, New York.

    Google Scholar 

  • K. Dowsland (1995) Variants of simulate annealing for practical problem solving, in: Applications of Modern Heuristic Methods, Ed. V. Rayward-Smith, Alfred Waller Ltd, in association with UNICOM, Henley-on-Thames.

    Google Scholar 

  • G. Ducek and T. Scheuer (1990) Threshold accepting: a general purpose optimization algorithm, Journal of Computational Physics, 90, 161–175.

    Article  Google Scholar 

  • R. Durbin and D. Willshaw (1987) An analogue approach to the TSP using elastic net method, Nature, 689–691.

    Google Scholar 

  • R.W. Eglese (1990) Simulated annealing: a tool for operational research, European Journal of Operational Research, 46, 271–281.

    Article  Google Scholar 

  • T.A Feo, M.G.C. Resende, and S.H. Smith (1994) A greedy randomized adaptive search procedure for maximum independent set, Operations Research 42, 860.

    Article  Google Scholar 

  • T.A. Feo and M.G.C. Resende (1994) Greedy randomized adaptive search procedures, Working paper, AT&T Bell Laboratories, Murray Hill, NJ 07974.

    Google Scholar 

  • T.A. Feo, and M.G.C. Resende, (1989) A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, 8, 67–71.

    Article  Google Scholar 

  • S. Forrest (1993) Proceedings of an International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA.

    Google Scholar 

  • B. Fox (1993) Integrating and accelerating tabu search, simulated annealing and genetic algorithms, Annals of Operations Research, 41, 47–67.

    Article  Google Scholar 

  • M.R. Garey and D.S. Johnson (1979) Computers and Intractability: a guide to the theory of NP-completeness, W.H. Freeman and Company, New York.

    Google Scholar 

  • M. Gendreau, A. Hertz, and G. Laporte (1994) A tabu search heuristic for the vehicle routing problem, Management Science 40, 1276–1290.

    Article  Google Scholar 

  • H. Ghaziri (1995) Supervision in the self-organizing feature map: Application to the vehicle routing in: Metaheuristics: the state of the art 1995, Eds. I.H. Osman and J.P. Kelly, Kluwers Academic Publishers, Boston.

    Google Scholar 

  • C.A. Glass and C.N. Potts (1995) A comparison of local search methods for flow shop scheduling, Annals of Operations Research, 60 Forthcoming.

    Google Scholar 

  • F. Glover, E. Pesch and I.H. Osman (1994) Efficient facility layout Planning, Working paper, Graduate School of Business, University of Colorado, Boulder, CO 80309.

    Google Scholar 

  • F. Glover, J.P. Kelly, and M. Laguna (1995) Genetic algorithms and tabu search — hybrids for optimization, Computers & Operations Research, 22, 111.

    Article  Google Scholar 

  • F. Glover, M. Laguna, E. Taillard and D. de Werra (1993) Tabu Search, Annals of Operations Research, 43, J.C. Baltzer Science Publishers, Basel, Switzerland.

    Google Scholar 

  • F. Glover (1995) Tabu search fundamentals and uses, Working paper, Graduate School of Business, University of Colorado, Boulder, CO 80309.

    Google Scholar 

  • F. Glover (1994) Tabu search: Improved solution alternatives, in: Mathematical Programming, State of the Art 1994, Eds. J.R. Brige and K.G. Murty, The University of Michigan, Michigan.

    Google Scholar 

  • F. Glover and A. Lokketangen (1994) Probabilistic tabu search for Zero-One mixed integer programming problems, Working paper, Graduate School of Business, University of Colorado, Boulder, CO 80309.

    Google Scholar 

  • F. Glover (1993) Tabu thresholding: improved search by non-monotonic trajectories, Working Paper, Graduate School of Business, University of Colorado, Boulder, Colorado 80309–0419 USA.

    Google Scholar 

  • F. Glover (1992) Ejection chains, reference structures and alternating path methods for the travelling salesman problems, Working paper, Graduate School of Business, University of Colorado, Boulder, CO 80309.

    Google Scholar 

  • F. Glover (1990) Tabu search: part H, ORSA Journal on Computing, 2, 4–32.

    Google Scholar 

  • F. Glover (1989) Tabu search: part I, ORSA Journal on Computing, 1, 190–206.

    Google Scholar 

  • F. Glover (1986) Future paths for integer programming and links to artificial intelligence, Computers and Operations Research, 1, 533–549.

    Article  Google Scholar 

  • D.E. Goldberg (1989) Genetic algorithms in search, Optimization, and Machine Learning, Addison-Wesley, New York.

    Google Scholar 

  • J.J. Grefenstette (1985) Proceedings of an International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA.

    Google Scholar 

  • J. Hart and A. Shogan (1987) Semi-greedy heuristics: an empirical study, Operations Research Letters, 6, 107–114.

    Article  Google Scholar 

  • M. Hasan and I.H. Osman (1995) Local search algorithms for the maximal planar layout problem, International Transactions in Operations Research, 2, 89–106.

    Article  Google Scholar 

  • J.H. Holland (1992) Adaptation in Natural and Artificial Systems, 2nd edition, The University of Michigan Press, Ann Arbor.

    Google Scholar 

  • J.J. Hopfield and D.W. Tank (1985) Neural computation of decisions in optimization problems, Biological Cybernetics, 52, 141–152.

    Google Scholar 

  • R. Husbscher and F. Glover (1994) Applying tabu search with influential diversification to multiprocessor scheduling, Computers & Operations Research, 21, 867.

    Article  Google Scholar 

  • L. Ingber (1993) Simulated annealing — practice versus theory, Mathematical And Computer Modelling 18, 29.

    Article  Google Scholar 

  • A.J. Jones (1993) Genetic algorithms and their applications to the design of neural networks, Neural Computing and Applications, 1, 32–45.

    Article  Google Scholar 

  • J.P. Kelly, M. Laguna and F. Glover (1994) A study of diversification strategies for the quadratic assignment problem, Computers & Operations Research, 21, 885.

    Article  Google Scholar 

  • P. Soriano and M. Gendreau (1995) Diversification strategies in tabu search algorithm for the maximum clique problem, Annals of Operations Research, 60 Forthcoming.

    Google Scholar 

  • S. Kirkpatrick, C.D. Gelatt, and P.M. Vecchi (1983) Optimization by simulated annealing, Science, 220, 671–680.

    Article  Google Scholar 

  • T. Kohonen (1988) Self-organization and Associative Memory, Springer-Verlag, Berlin.

    Google Scholar 

  • A. Kolen and E. Pesch (1994) Genetic local search in combinatorial optimization, Discrete Applied Mathematics, 48, 273.

    Article  Google Scholar 

  • G. Kontoravdis and J.F. Bard (1995) Improved heuristics for the vehicle routing problem with time windows, ORSA Journal on Computing, 7, Forthcoming.

    Google Scholar 

  • C. Koulamas, S.R. Antony and R. Jaen, (1994) A survey of simulated annealing application to operations research problems, OMEGA, 22, 41–56.

    Article  Google Scholar 

  • P.J. van Laarhoven, and E.H.L. Aarts (1987) Simulated Annealing: Theory and Applications, Reidl, Dordrecht.

    Google Scholar 

  • M. Laguna, T.A. Feo and H.C. Elrod (1994) A greedy randomized adaptive search procedure for the two-partition problem, Operations Research, 42, 677–687.

    Article  Google Scholar 

  • G. Laporte and I.H. Osman (1995a) Meta-heuristics in Combinatorial Optimization, (J.C. Baltzer Science Publishers, Basel, Switzerland, 1995).

    Google Scholar 

  • G. Laporte and I.H. Osman (1995b) Routing Problems: A bibliography, Annals of Operations Research, Forthcoming.

    Google Scholar 

  • E.L. Lawler (1976) Combinatorial Optimization: Networks and Matroids, Holt, Rineh art and Winston, New York.

    Google Scholar 

  • F.T. Lin, C.Y. Kao and C.C. Hsu (1993) Applying the genetic approach to simulated annealing in solving some NP-hard problems, IEEE Transactions on Systems Man and Cybernetics 23, 1752–1567.

    Article  Google Scholar 

  • C.K. Looi (1992) Neural network methods in combinatorial optimization, Computers & Operations Research, 19, 191–208.

    Article  Google Scholar 

  • W. Metropolis, A. Roenbluth, M. Rosenbluth, A. Teller, and E. Teller (1953) Equation of the state calculations by fast computing machines, Journal of Chemical Physics, 21, 1087–1092.

    Article  Google Scholar 

  • Z. Michalewicz (1994) Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, End edition, New York.

    Google Scholar 

  • H. Mulhenbein (1995) Evolutionary algorithms: theory and application, in: Local Search in Combinatorial Optimization, Eds E.H.L. Aarts and J.K. Lenstra, John Wiley and Sons, Chichester.

    Google Scholar 

  • A. Nagar, S.S. Heragu and J. Haddock (1995) A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem, Annals of Operations Research, 60, Forthcoming.

    Google Scholar 

  • G.L. Nemhauser and L.A. Wolsey (1988) Integer and Combinatorial Optimization, John Wiley & Sons, New York.

    Google Scholar 

  • V. Nissen (1993) Evolutionary algorithm in Management Science: an overview and list of references, Working Paper 9309, University of Goettinggen, Gosslerstr. 12a, D-37073 Goettingen, Germany, can be obtained by anonymous ftp gwdu03.gwdg.de in pub/msdos/reports/wi.

    Google Scholar 

  • I.H. Osman (1995a) An introduction to Meta-heuristics, in: Operational Research Tutorial Papers Series, Annual Conference OR37 — Canterbury 1995, Eds. C. Wildson and M. Lawrence (Operational Research Society Press, 1995).

    Google Scholar 

  • I.H. Osman (1995b) Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches, OR Spektrum, 17, 2/3 Forthcoming.

    Google Scholar 

  • I.H. Osman (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Annals of Operations Research, 41, 421–451.

    Article  Google Scholar 

  • I.H. Osman and J.P. Kelly (1995), Proceedings of the Metaheuristics International Conference, Breckenridge, Colorado, (Kluwers Academic Publishers, Boston, July 1995).

    Google Scholar 

  • I.H. Osman and G. Laporte (1995) Metaheuristics for combinatorial optimization problems: An annotated bibliography, Annals of Operational Research, 60, Forthcoming.

    Google Scholar 

  • I.H. Osman and N. Christofides (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search, International Transactions in Operational Research, 1, 317–336.

    Article  Google Scholar 

  • I.H. Osman and S. Salhi, Local search strategies for the mix fleet vehicle routing problem, Working paper UKC/IMS/OR93/8, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK (1993).

    Google Scholar 

  • C.H. Papadimitriou and K. Steiglitz (1982) Combinatorial optimization: algorithms and complexity, Prentice Hall, New York.

    Google Scholar 

  • E. Pesch and S. Voss (1995) Applied Local Search, OR Spektrum, 17, Springer-Verlag, Germany.

    Google Scholar 

  • M. Pirlot (1992) General local search heuristics in combinatorial optimization: a tutorial, Belgian Journal of Operations, Statistics, and Computer Science, 32, 7–67.

    Google Scholar 

  • J.-Y. Potvin (1993) the travelling salesman problem: A neural network perspective, ORSA Journal on Computing, 5, 328–348.

    Google Scholar 

  • V.J. Ray ward-Smith (1995) Applications of Modern Heuristic Methods, Alfred Waller Ltd, in association with UNICOM, Henley-on-Thames.

    Google Scholar 

  • C.R. Reeves (1993) Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford.

    Google Scholar 

  • R. Rego and C. Roucairol (1994) An efficient implementation of ejection chain procedures for the vehicle routing problem, Working paper RR-94/44, Laboratoire PRiSM, Universite de Versailles, France.

    Google Scholar 

  • R.A. Russell (1995) Hybrid heuristics for the vehicle routing problem with time windows, Transportation Science, Forthcoming.

    Google Scholar 

  • J.D. Schaffer (1989) Proceedings of the Third International Conference on Genetic Algorithms Morgan Kaufmann Publishers, San Mateo, CA.

    Google Scholar 

  • M. Sinclair (1993) Comparison of the performance of modern heuristics for combinatorial problem on real data, Computers & Operations Research, 20, 687–695.

    Article  Google Scholar 

  • B.S. Stewart, C.-F Liaw and C.C. White (1994) A bibliography of heuristic search through 1992, IEEE Transactions on Systems, Man, and Cybernetics, 24, 268–293.

    Article  Google Scholar 

  • R.H. Storer, S.D. Wu and R. Vaccari (1992) New search spaces for sequencing problems with application to job shop scheduling, Management Science, 38, 1495–1509.

    Article  Google Scholar 

  • R.H. Storer, S.W. Flanders and S.D. Wu (1995) Problem space local search for number partitioning, Annals of Operations Research, 60, Forthcoming.

    Google Scholar 

  • E. Taillard (1991) Robust taboo search for the quadratic assignment problem, Parallel Computing, 17, 443–455.

    Article  Google Scholar 

  • S.R. Thangiah, I.H. Osman, R. Vinayagamoorthy and T. Sun (1993) Algorithms for vehicle routing problems with time deadlines, American Journal of Mathematical and Management Sciences, 13, 323–354

    Google Scholar 

  • S.R. Thangiah, I.H. Osman and T. Sun (1994) Metaheuristics for vehicle routing problems with time windows, Working paper UKC/IMS/OR94/8, Institute of Mathematics and Statistics, University of Kent, Canterbury. Forthcoming in Annals of OR.

    Google Scholar 

  • A.I. Vakutinsky and B.L. Golden (1995) A hierarchical strategy for solving traveling salesman problem using elastic nets, Journal of Heuristics, Forthcoming.

    Google Scholar 

  • V. Valls, R. Marti and P. Lino (1995) A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, Annals of Operations Research, 60, Forthcoming.

    Google Scholar 

  • H.P. Williams (1990) Model Building in Mathematical Programming, 3rd edition, John Wiley & Sons, New York.

    Google Scholar 

  • D.L. Woodruff and Z. Zemel (1993) Hashing vectors for tabu search, Annals of Operations Research, 41, 123–138.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Statistics, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Ibrahim H. Osman

  2. School of Business, Campus Box 419, University of Colorado, Boulder, CO, 80309, USA

    James P. Kelly

Authors
  1. Ibrahim H. Osman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James P. Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Statistics, University of Kent, Cantebury Kent, CT2 7NF, UK

    Ibrahim H. Osman (Programme Chair) (Programme Chair)

  2. School of Business, University of Colorado, Campus Box 419, Boulder, 55455, Colorado, USA

    James P. Kelly (Organizing Chair) (Organizing Chair)

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Osman, I.H., Kelly, J.P. (1996). Meta-Heuristics: An Overview. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1361-8_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8587-8

  • Online ISBN: 978-1-4613-1361-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation