A Discrete Differential Evolution Approach with Local Search for Traveling Salesman Problems

  • João Guilherme Sauer
  • Leandro dos Santos Coelho
  • Viviana Cocco Mariani
  • Luiza de Macedo Mourelle
  • Nadia Nedjah
Part of the Studies in Computational Intelligence book series (SCI, volume 357)

Abstract

Combinatorial optimization problems are very commonly seen in scientific research and practical applications. Traveling Salesman Problem (TSP) is one nonpolynomial-hard combinatorial optimization problem. It can be describe as follows: a salesman, who has to visit clients in different cities, wants to find the shortest path starting from his home city, visiting every city exactly once and ending back at the starting point. There are exact algorithms, such as cutting-plane or facet-finding, are very complex and demanding of computing power to solve TSPs. There here, however, metaheuristics based on evolutionary algorithms that are useful to finding solutions for a much wider range of optimization problems including the TSP. Differential Evolution (DE) is a relatively simple evolutionary algorithm, which is an effective adaptive approach to global optimization over continuous search spaces. Furthermore, DE has emerged as one of the fast, robust, and efficient global search heuristics of current interest. DE shares similarities with other evolutionary algorithms, it differs significantly in the sense that distance and direction information from the current population is used to guide the search process. Since its invention, DE has been applied with success on many numerical optimization problems outperforming other more popular metaheuristics such as the genetic algorithms. Recently, some researchers extended with success the application of DE to combinatorial optimization problems with discrete decision variables. In this paper, the following discrete DE approaches for the TSP are proposed and evaluated: i) DE approach without local search, ii) DE with local search based on Lin-Kernighan-Heulsgaun (LKH) method, and iii) DE with local search based on Variable Neighborhood Search (VNS) and together with LKH method. Numerical study is carried out using the TSPLIB of test TSP problems. In this context, the computational results are compared with the other results in the recent TSP literature. The obtained results show that LKH method is the best method to reach optimal results for TSPLIB benchmarks, but for largest problems, the DE+VNS improve the quality of obtained results.

Keywords

Optimization Traveling salesman problem Evolutionary Algorithm Differential Evolution Variable Neighbor Search Local Search Lin-Kernighan-Heulsgaun 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)MATHGoogle Scholar
  2. 2.
    Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial optimization problems. International Transactions in Operational Research 3(1), 1–21 (1996)MATHCrossRefGoogle Scholar
  3. 3.
    Laporte, G.: The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59(2), 231–247 (1992)MATHCrossRefGoogle Scholar
  4. 4.
    Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)CrossRefGoogle Scholar
  5. 5.
    Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B. (eds.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)MATHGoogle Scholar
  6. 6.
    Ding, Z., Leung, H., Zhu, Z.: A study of the transiently chaotic neural network for combinatorial optimization. Mathematical and Computer Modelling 36(9-10), 1007–1020 (2002)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Katayama, K., Sakamoto, H., Narihisa, H.: The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling 31(10-12), 197–203 (2000)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Carter, A.E., Ragsdale, C.T.: A new approach to solving the multiple traveling salesperson problem using genetic algorithms. European Journal of Operational Research 175(1), 246–257 (2006)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Storn, R., Price, K.: Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA, USA (1995)Google Scholar
  10. 10.
    Storn, R., Price, K.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4), 341–359 (1997)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Tasgetiren, M.F., Pan, Q.K., Liang, Y.C., Suganthan, P.N.: A discrete differential evolution algorithm for the total earliness and tardiness penalties with a common due date on a single-machine. In: Proceedings of IEEE Symposium on Computational Intelligence in Scheduling, Honolulu, HI, USA, pp. 271–278 (2007)Google Scholar
  12. 12.
    Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., Liang, Y.C.: A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion. In: Proceedings of IEEE Symposium on Computational Intelligence in Scheduling, Honolulu, HI, USA, pp. 251–258 (2007)Google Scholar
  13. 13.
    Tasgetiren, M.F., Suganthan, P.N., Pan, Q.K.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. In: Proceedings of Genetic and Evolutionary Computation Conference, London, UK, pp. 158–167 (2007)Google Scholar
  14. 14.
    Qian, B., Wang, L., Huang, D.-X., Wang, W.-L., Wang, X.: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research 36(1), 209–233 (2009)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171(2), 674–692 (2006)MATHCrossRefGoogle Scholar
  16. 16.
    Helsgaun, K.: An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research 126(1), 106–130 (2000)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Mladenovic, N.: A variable neighborhood algorithm – a new metaheuristic for combinatorial optimization. In: Abstracts of Papers at Optimization Days, Montreal, Canada, vol. 112 (1995)Google Scholar
  18. 18.
    Mladenovic, N., Hansen, P.: Variable neighbourhood search. Computers and Operations Research 24(11), 1097–1100 (1997)MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Reinelt, G.: TSPLIB – a traveling salesman problem library. ORSA Journal on Computing 4, 134–143 (1996), http://www.iwr.uni-heidelberg.de/groups/comopt/software/ MathSciNetGoogle Scholar
  20. 20.
    Montes, E.M., Reyes, J.V., Coello, C.A.C.: A comparative study of differential evolution variants for global optimization. In: Proceedings of Genetic and Evolutionary Computation Conference, Seattle, Washington, USA (2006)Google Scholar
  21. 21.
    Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single-machine total weighted tardiness problem. In: Proceedings of Congress on Evolutionary Computation, Portland, Oregon, USA, vol. 2, pp. 1412–1419 (2004)Google Scholar
  22. 22.
    Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382–389. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  23. 23.
    Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6(2), 154–160 (1994)MATHGoogle Scholar
  24. 24.
    Eberhard, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  25. 25.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • João Guilherme Sauer
    • 1
  • Leandro dos Santos Coelho
    • 1
    • 3
  • Viviana Cocco Mariani
    • 2
    • 3
  • Luiza de Macedo Mourelle
    • 4
  • Nadia Nedjah
    • 5
  1. 1.Industrial and Systems Engineering Graduate Program, PPGEPSPontifical Catholic University of Parana, PUCPRCuritibaBrazil
  2. 2.Mechanical Engineering Graduate Program, PPGEMPontifical Catholic University of Parana, PUCPRCuritibaBrazil
  3. 3.Department of Electrical Engineering, PPGEEFederal University of Parana, UFPR Polytechnic CenterCuritibaBrazil
  4. 4.Department of Systems Engineering and Computation Faculty of EngineeringState University of Rio de JaneiroRio de JaneiroBrazil
  5. 5.Department of Electronics Engineering and Telecommunications Faculty of EngineeringState University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations