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

Conference paper
Part of the Advances in Intelligent and Soft Computing book series (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.

Keywords

Genetic Algorithm Local Search Mutation Operator Travel Salesman Problem Travel Salesman Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 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. 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. 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)CrossRefGoogle Scholar
  6. 6.
    Lin, S.: Computer solutions of the traveling salesman problem. Bell Systems Journal 44, 2245–2269 (1965)MATHGoogle Scholar
  7. 7.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)MathSciNetMATHCrossRefGoogle Scholar
  8. 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-6Google Scholar
  9. 9.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)Google Scholar
  10. 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. 11.
    Hansen, P., Mladenovié, N.: First Vs Best Improvement: An Empirical Stud. Science Direct. Discrete Applied Mathematics 154, 802–817 (2006)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
  13. 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. 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. 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. 16.
    Koza, J.R.: Genetic Programming. Bradford /MIT Press (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Computer Science Department, MISC LaboratoryMentouri University- ConstantineConstantineAlgeria

Personalised recommendations