Advertisement

A Modified and Enhanced Ant Colony Optimization Algorithm for Traveling Salesman Problem

  • Leila Eskandari
  • Ahmad Jafarian
  • Parastoo Rahimloo
  • Dumitru Baleanu
Chapter
Part of the Nonlinear Systems and Complexity book series (NSCH, volume 23)

Abstract

In this paper an effective modification has been performed on the Ant Colony Optimization algorithm and used for solving traveling salesman problem (TSP). The traveling salesman problem is one of the famous and important problems and it has been used in the algorithms to analyze its performance in solving the discreet problems. The modified and enhanced ACO has been used for solving this problem and it is called MEACO. In MEACO the modification has been performed by taking effect of mutation on the global best and personal best of each ant. The personal best is stored for each ant same as the PSO algorithm. Original ACO for discrete problems mostly trap in the local solutions, but the proposed method has been designed to cover this deficiency and make it more suitable for optimization of discrete problems. The experiment on the set of benchmark problems for Traveling salesman was performed and obtained results showed that MEACO is an effective method in finding the path for TSP.

References

  1. 1.
    Abdel-Moetty, S.M.: Traveling salesman problem using neural network techniques. In: The 7th International Conference on Informatics and Systems (INFOS), Cairo, pp. 1–6 (2010)Google Scholar
  2. 2.
    Chandra, B., Karloff, H., Tovey, C.: New results on the old k-opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998–2029 (1999)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Chiung, M., Jongsoo, K., Gyunghyun, C., Yoonho, S.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 40, 606–617 (2002)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Elloumi, W., Abed, H.E., Abraham, A., Alimi, A.M.:. A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP. Appl. Soft Comput. 25, 234–241 (2014)CrossRefGoogle Scholar
  5. 5.
    Garcia, S., Molina, D., Lozano, M., Herrera, F.: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J. Heuristics 15, 617–644 (2009)CrossRefGoogle Scholar
  6. 6.
    Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Soft Comput. 11(4), 3680–3689 (2011)CrossRefGoogle Scholar
  7. 7.
    Jolaia, F., Tavakkoli-Moghaddama, R., Rabieeb, M., Gheisariha, E.: An enhanced invasiveweed optimization for makespan minimization in a flexible flowshop scheduling problem. Scientia Iranica 21(3), 1007–1020 (2014)Google Scholar
  8. 8.
    Li, Y.: Solving TSP by an ACO-and-BOA-based hybrid algorithm. Comput. Appl. Syst. Model. 12, 189–192 (2010)Google Scholar
  9. 9.
    Mahi, M., Baykan, O.K., Kodaz, H.: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl. Soft Comput. 30, 484–490 (2015)CrossRefGoogle Scholar
  10. 10.
    Schrijver’s, A., Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.): On the history of combinatorial optimization. In: Discrete Optimization, pp. 1–68. Elsevier, Amesterdam (2005)Google Scholar
  11. 11.
    Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inform. Process. 103(5), 169–176 (2007)MathSciNetCrossRefGoogle Scholar
  12. 12.
    The TSPLIB Symmetric Traveling Salesman Problem Instances. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp
  13. 13.
    Wang, Z., Guo, J., Zheng, M., Wang, Y.: Uncertain multiobjective traveling salesman problem. Eur. J. Oper. Res. 241, 478–489 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Xiaoming, Z., Rujing, W., Liangtu, S.: A novel evolutionary algorithm bean optimization algorithm. Pattern Recognit. Artif. Intell. 21(5), 677–681 (2008)Google Scholar
  15. 15.
    Yang, J., Shi, P., Marchese, M., Liang, Y.: An ant colony optimization method for generalized TSP problem. Prog. Nat. Sci. 18, 1417–1422 (2008)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Leila Eskandari
    • 1
  • Ahmad Jafarian
    • 2
  • Parastoo Rahimloo
    • 2
  • Dumitru Baleanu
    • 3
  1. 1.Department of Computer EngineeringUrmia Branch, Islamic Azad UniversityUrmiaIran
  2. 2.Department of MathematicsUrmia Branch, Islamic Azad UniversityUrmiaIran
  3. 3.Department of MathematicsÇankaya UniversityAnkaraTurkey

Personalised recommendations