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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
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)
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)
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)
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)
Li, Y.: Solving TSP by an ACO-and-BOA-based hybrid algorithm. Comput. Appl. Syst. Model. 12, 189–192 (2010)
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)
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)
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)
The TSPLIB Symmetric Traveling Salesman Problem Instances. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp
Wang, Z., Guo, J., Zheng, M., Wang, Y.: Uncertain multiobjective traveling salesman problem. Eur. J. Oper. Res. 241, 478–489 (2015)
Xiaoming, Z., Rujing, W., Liangtu, S.: A novel evolutionary algorithm bean optimization algorithm. Pattern Recognit. Artif. Intell. 21(5), 677–681 (2008)
Yang, J., Shi, P., Marchese, M., Liang, Y.: An ant colony optimization method for generalized TSP problem. Prog. Nat. Sci. 18, 1417–1422 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Eskandari, L., Jafarian, A., Rahimloo, P., Baleanu, D. (2019). A Modified and Enhanced Ant Colony Optimization Algorithm for Traveling Salesman Problem. In: Taş, K., Baleanu, D., Machado, J. (eds) Mathematical Methods in Engineering. Nonlinear Systems and Complexity, vol 23. Springer, Cham. https://doi.org/10.1007/978-3-319-91065-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-91065-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91064-2
Online ISBN: 978-3-319-91065-9
eBook Packages: EngineeringEngineering (R0)