Skip to main content
SpringerLink
Log in

Integrating the Best 2-Opt Method to Enhance the Genetic Algorithm Execution Time in Solving the Traveler Salesman Problem

  • Conference paper
Book cover Complex Systems and Dependability

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 170))

Abstract

The traveling salesman problem (TSP) is one of the classic combinatorial optimization problem NP-complete that requires much time to find the good solution. Indeed, the genetic algorithm is a stochastic optimization algorithm; it is to find an approximate solution of a hard problem. However, genetic algorithm has a great tendency to converge to a local minimum and stay stuck in adverse solutions. To solve this problem, we study in this paper the impact of the integration of a new local optimization heuristic Best 2-opt with the genetic operators on the quality of solution and the runtime of the GA. The hybridization proposed was tested on instances from 29 to 246 cities. The obtained results are very satisfied regarding to the solution qualities and the execution time.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)

    Article  Google Scholar 

  2. Goldberg, D.E., Lingle, R.J.: Alleles, Loci and the TSP. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154–159 (1985)

    Google Scholar 

  3. Oliver, I.M., Smith, D.J., Holland, J.R.C.: A Study of Permutation Crossovers on the TS. In: Genetic Algorithm and Their Applications on Proceedings of the Second International Conference, pp. 224–230 (1987)

    Google Scholar 

  4. Davis, L.: Applying Adaptive Algorithms to Epistatic Domains. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 162–164 (1985)

    Google Scholar 

  5. Freisleben, B., Merz, P.: New Genetic Local Search Operators for the Traveling Salesman Problem. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 890–899. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Lin, S.: Computer solutions of the traveling salesman problem. Bell Systems Journal 44, 2245–2269 (1965)

    MATH  Google Scholar 

  7. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Milan, D., Milan, T., Bojan, D.: Impact Of Graffing A 2-Opt Algorithm Based Local Searcher into the Genetic Algorithm. In: International Conference on Applied Informatics and Communications (AIC 2009), pp. 485–490 (2009) ISBN: 978-960-474-107-6

    Google Scholar 

  9. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  10. Li, L., Zhang, Y.: An Improved Genetic Algorithm for The Traveling Salesman Problem. In: ICIC 2007. CCIS, vol. 2, pp. 208–216. Springer (2007)

    Google Scholar 

  11. Hansen, P., Mladenovié, N.: First Vs Best Improvement: An Empirical Stud. Science Direct. Discrete Applied Mathematics 154, 802–817 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. http://compt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp/

  13. Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment. Research report, Institute of Computing Science, Poznan University of Technology. RA-002 (2000)

    Google Scholar 

  14. Wu, Y., Liu, M., Wu, C.: A Genetic Algorithm for Solving Flow Shop Scheduling Problems with Parallel Machine and Special Procedure Constraint. In: International Conference on Machine Learning and Cybernetics, Xi’an, China, vol. 3, pp. 1774–1779 (2003)

    Google Scholar 

  15. Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Caltech Concurrent Computation Program (report 826) (1989)

    Google Scholar 

  16. Koza, J.R.: Genetic Programming. Bradford /MIT Press (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, MISC Laboratory, Mentouri University- Constantine, Constantine, Algeria

    Sara Sabba & Salim Chikhi

Authors
  1. Sara Sabba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Salim Chikhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sara Sabba .

Editor information

Editors and Affiliations

  1. , Institute of Computer Engineering,, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wroclaw, 50-372, Poland

    Wojciech Zamojski

  2. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wrocław, 50-372, Poland

    Jacek Mazurkiewicz

  3. , Institute of Computer Engineering,, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wroclaw, 50-372, Poland

    Jarosław Sugier

  4. , Institute of Computer Engineering,, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wroclaw, 50-372, Poland

    Tomasz Walkowiak

  5. Systems Research Instiute, Polish Academy of Sciences, Newelska 6, Warszawa, 01-447, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sabba, S., Chikhi, S. (2013). Integrating the Best 2-Opt Method to Enhance the Genetic Algorithm Execution Time in Solving the Traveler Salesman Problem. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Complex Systems and Dependability. Advances in Intelligent and Soft Computing, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30662-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30662-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30661-7

  • Online ISBN: 978-3-642-30662-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation