Skip to main content
SpringerLink
Log in

Fitness Landscapes and Performance of Meta-Heuristics

  • Chapter
Meta-Heuristics

Abstract

We perform a statistical analysis of the structure of the search space of some planar, euclidian instances of the traveling salesman problem. We want to depict this structure from the point of view of iterated local search algorithms. The objective is two-fold: understanding the experimentally known good performance of metaheuristics on the TSP and other combinatorial optimization problems; designing new techniques to search the space more efficiently. This work actually led us to design a hybrid genetic algorithm that competes rather well with other local search heuristics for the TSP, notably Jünger et al.’s version of ILK. This work also opens promising horizons to the study of other combinatorial optimization problems such as the quadratic assignment problem.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

  1. E. Aarts, J.K. Lenstra (eds), Local Search in Combinatorial Optimization, Wiley, 1997

    Google Scholar 

  2. K.D. Boese, Models For Iterative Global Optimization, PhD Dissertation, UCLA, USA, 1996

    Google Scholar 

  3. K.D. Boese, A.B. Kahng, S. Muddu, A New Adaptive Multi-Start Technique For Combinatoiral Global Optimizations, Operations Research Letters, 16, 101–113, 1994

    Article  Google Scholar 

  4. G.A. Croes, A Method For Solving The Traveling Salesman Problems, Operations Research, 6, 791–812, 1958

    Article  Google Scholar 

  5. M. Dorigo, L. Gambardella, Ant Colony System: A Cooperative learning approach to the traveling salesman problem, Evolutionary Computation, 1(1), 1997

    Google Scholar 

  6. J. Frank, P. Cheeseman, J. Stutz, When Gravity Fails: Local Search Topology, Journal Of Artificial Intelligence Research, 7, 249–281, 1997

    Google Scholar 

  7. M.R. Garey, D.S. Johnson, Computers And Intractability: A Guide To The Theory Of NP-Completeness, Freeman, 1979

    Google Scholar 

  8. F. Glover, Tabu Search: part I, ORSA Journal on Computing, 1, 190–206, 1989

    Article  Google Scholar 

  9. F. Glover, Tabu Search: part II, ORSA Journal on Computing, 2, 4–32, 1990

    Article  Google Scholar 

  10. D. Goldberg, Genetic algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989

    Google Scholar 

  11. L.K. Grover, Local Search And The Local Structure Of NP-Complete Problems, Operations Research Letters, 12, 235–243, 1992

    Article  Google Scholar 

  12. A. Hertz, B. Jaumard, M. Poggi de Aragão, Local optima topology for the k-coloring problem, Discrete Applied Mathematics, 49, 257–280, 1994

    Article  Google Scholar 

  13. W. Hordijk, A Measure Of Landscapes, Evolutionary Computation, 4(4), 1996

    Google Scholar 

  14. D.S. Johnson, The Traveling Salesman Problem: A Case Study, in [1], 215–310, 1997

    Google Scholar 

  15. D.S. Johnson, J.L. Bentley, L.A. McGeoch, E.E. Rothberg, Near-Optimal Solutions To Very Large Traveling Salesman Problems, to appear

    Google Scholar 

  16. M. Jünger, G. Reinelt, G. Rinaldi, The Traveling Salesman Problem, Network Models, Handbooks in Operations Research and Management Science, Volume 7, North-Holland Amsterdam, 225–330, 1995

    Article  Google Scholar 

  17. S. Kauffman, Adaptation on Rugged Fitness Landscapes, and Principles of Adaptation in Complex Systems, in D.L. Stein, Lectures In The Sciences Of Complexity volume I, Addison-Wesley, 1989

    Google Scholar 

  18. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization by Simulated Annealing, Science, 220(4598), 671–680, 1983

    Article  Google Scholar 

  19. S. Kirkpatrick, G. Toulouse, Configuration Space Analysis Of The Traveling Salesman Problem, Journal de Physique, 46, 1277–1292, 1985

    Article  Google Scholar 

  20. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (eds), The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, Wiley, 1985

    Google Scholar 

  21. S. Lin, Computer Solutions Of The Traveling Salesman Problem, Bell System Technical Journal, 44, 2245–2269, 1965

    Google Scholar 

  22. S. Lin, B. Kernighan, An Effective Heuristic Algorithm For The Traveling Salesman Problem, Operations Research, 21, 498–516, 1973

    Article  Google Scholar 

  23. B. Manderick, M.D. Weger, P. Spiessens, The Genetic Algorithm and the Structure of the Fitness Landscape, in R. Belew (ed), Proc. International Conf. on Genetic Algorithms, Morgan-Kaufman, 1991

    Google Scholar 

  24. O. Martin, S.W. Otto, Combining Simulated Annealing With Local Search Heuristics, Annals of Operations Research, 63, 57–75, 1996

    Article  Google Scholar 

  25. O. Martin, S.W. Otto, E.W. Feiten, Large-step Markov Chains for the TSP Incorporating Local Search, Operation Research Letters, 1, 219–224, 1992

    Article  Google Scholar 

  26. Z. Michalewicz, Genetic Algorithm + Data Structure = Evolution Program, Springer-Verlag, 1995

    Google Scholar 

  27. H. Mühlenbein, Genetic Algorithms, in [1], 137–171, 1997

    Google Scholar 

  28. C. Reeves (ed), Modern Heuristic Techniques for Combinatorial Optimization, Blackwell, 1993

    Google Scholar 

  29. G. Reinelt, TSPLIB: A Traveling Salesman Problem Library, ORSA Journal on Computing, 3, 376–384, 1991. The TSPLIB is available on the web.

    Article  Google Scholar 

  30. P. Stadler, Towards A Theory Of Landscapes, in R. Lopès-Peña, R. Capovilla, R. Garcia-Pelayo, H. Waelbroeck, F. Zertuche (eds), Complex Systems and Binary Networks, Springer-Verlag, 1995

    Google Scholar 

  31. P. Stadler, W. Schnabl, The Lansdscape Of The Traveling Salesman Problem, Physics Letter A, 161, 337–344, 1992

    Article  Google Scholar 

  32. E.D. Weinberger, Correlated and Uncorrelated Fitness Landscapes And How To Tell The Difference, Biological Cybernetics, 63, 325–336, 1995

    Article  Google Scholar 

  33. E.D. Weinberger, Local Properties of Kauffman’s N-k model: A Tunably Rugged Energy Landscape, Physical Review A, 44(10), 6399–6413, 1995

    Article  Google Scholar 

  34. D. Whitley, T. Starkweather, D. Shaner, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator, Proc. 3rd ICGA, Morgan Kaufmann, 133–140, 1989 Chapter 22, 350-372, 1991

    Google Scholar 

  35. M. Yannakakis, The Analysis Of Local Search Problems And Their Heuristics, in Proc. STACS’90, Lecture Notes In Computer Science, 415, 298–311, 1990

    Google Scholar 

  36. M. Yannakakis, Computational Complexity, in [1], 19–55, 1997

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIL, Université du Littoral-Côte d’Opale, BP 719, 62228, Calais Cedex, France

    Cyril Fonlupt, Denis Robilliard & Philippe Preux

  2. LIFL, Université de Lille 1, Bâtiment M3, 59655, Villeneuve d’Ascq Cedex, France

    El-Ghazali Talbi

Authors
  1. Cyril Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Robilliard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philippe Preux
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. El-Ghazali Talbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Braunschweig, Germany

    Stefan Voß

  2. University of Bologna, Italy

    Silvano Martello

  3. University of Kent, UK

    Ibrahim H. Osman

  4. University of Versailles, France

    Catherine Roucairol

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Fonlupt, C., Robilliard, D., Preux, P., Talbi, EG. (1999). Fitness Landscapes and Performance of Meta-Heuristics. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5775-3_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7646-0

  • Online ISBN: 978-1-4615-5775-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation