Abstract
Travelling Salesman Problem is the most widely studied combinatorial optimization problem which has attracted many researchers in the last few years. It is recognized as one of popular NP-Hard problem that has broad search space. TSP is a difficult problem which can't be solved by conventional methods particularly when the number of cities increases. So, to solve this problem efficiently, heuristic approach is the most feasible solution. Genetic Algorithm and Ant Colony Optimization are commonly used metaheuristics to solve TSP successfully. To solve TSP, this paper considers the three eminent heuristic approaches namely ACO, GA and hybrid GA-ACO.
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
Similar content being viewed by others
Bibliography
Brezina Jr I, Čičková Z (2011) Solving the travelling salesman problem using the ant colony optimization. Manag Inf Syst 6(4):010–014
Rai K, Madan L, Anand K (2014) Research paper on travelling salesman problem and it’s solution using genetic algorithm. Int J Innov Res Technol 1(11):103–114
Singp S, Kumari A (2013) Analysis of travelling salesman problem using ant colony optimization, genetic algorithm and hybrid of ant colony optimization and genetic algorithm. Int J Eng Res Technol 2(7):1896–1900
Duan H, Yu X (2007) Hybrid ant colony using memetic algorithm for travelling salesman problem. In: Proceedings of the 2007 IEEE symposium on approximate dynamic programming and reinforcement learning, pp 92–95
Dorigo M (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern 26(1):1–13
Ting TO, Yang XS, Cheng S, Huang K (2015) Hybrid metaheuristic algorithms: past, present, and future. Recent advances in swarm intelligence and evolutionary computation, vol 585, pp 71–83
Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11(6):4135–4151
Gong D, Ruan X (2004) A hybrid approach of GA and ACO for TSP. In: Proceedings of 5th world congress on intelligent control and automation, vol 3, pp 2068–2072
Li S, Chen H, Tang Z (2011) Study of pseudo-parallel genetic algorithm with ant colony optimization to solve the TSP. Int J Comput Sci Netw Secur 11(3)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ankita (2022). Travelling Salesman Problem Using GA-ACO Hybrid Approach: A Review. In: Kumar, A., Senatore, S., Gunjan, V.K. (eds) ICDSMLA 2020. Lecture Notes in Electrical Engineering, vol 783. Springer, Singapore. https://doi.org/10.1007/978-981-16-3690-5_11
Download citation
DOI: https://doi.org/10.1007/978-981-16-3690-5_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-3689-9
Online ISBN: 978-981-16-3690-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)