Skip to main content

Mixing Different Components of Metaheuristics

  • Chapter
Meta-Heuristics

Abstract

This paper studies the effects of mixing different components of metaheuristics applied to the TSP, namely simulated annealing and a new combinatorial optimization one, called the noising method. The results deal with the comparison of these methods with a given number of evaluations of the function to optimize. Many combinations have been tested: they show that the classical patterns are not always the best.

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

Access this chapter

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. Bonomi and J.-L. Lutton, The N-city traveling salesman problem: statistical mechanics and the Metropolis algorithm, SIAM Review 26 (1984)552.

    Article  Google Scholar 

  • I. Charon and O. Hudry, The noising method: a new method for combinatorial optimization, Operations Research Letters 14 (1993) 133.

    Article  Google Scholar 

  • F. Glover, E. Taillard and D. de Werra, A user’s guide to Tabu search, Annals of Operations Research 41 (1993) 3.

    Article  Google Scholar 

  • A. Hertz and D. de Werra, Using Tabu search techniques for graph coloring, Computing 29 (1987) 345.

    Article  Google Scholar 

  • D.S. Johnson, CR. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation, Part II (Graph coloring and number partitioning), Operations Research 39 (1991) 378.

    Article  Google Scholar 

  • P.J.M. van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Practice, (Kluwer Academic Publishers, Dordrecht 1987).

    Google Scholar 

  • S. Linet B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Operations Research 21 (1973) 498.

    Article  Google Scholar 

  • M. Pirlot, General local search heuristics in Combinatorial Optimization: a tutorial, JORBEL 32 (1992) 7.

    Google Scholar 

  • G. Reinelt, TSPLIB - A Traveling Salesman Problem Library, ORSA Journal on Computing 3 (1991) 376.

    Google Scholar 

  • R.V.V. Vidal (ed.): Applied Simulated Annealing, (Springer, Berlin 1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Charon, I., Hudry, O. (1996). Mixing Different Components of Metaheuristics. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_35

Download citation

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

  • 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