doi: 10.7763/IJET.2018.V10.1069
A Hybrid Model Of Max-Min Ant System with Genetic Algorithm For Improved To Travelling Salesman Problem
Tuncay Aydoğan
1
,
Raed Al-Badri
2
- 1 the Department of Software Engineering, Suleyman Demirel University, 32260, Turkey
- 2 the Department of Computer Engineering, Suleyman Demirel University, 32260, Turkey
Abstract
Travelling Salesman Problem (TSP) is one of the oldest combinatorial problems that are classified as NP-hard. Hence, solving this type of problems requires a tremendous number of computational complexities by an intensive search process. Though TSP is an old problem, it is still the attractive spot of study for many researchers due to using in its many applications. The TSP problem is tackled by using a new hybrid algorithm approach in this work. This hybrid approach is applied with Genetic Algorithm (GA) that invokes Max-Min Ant System (MMAS) algorithm to minimize the cost, called HGAMMAS. In the experimental results of HGAMMAS reached to BKS(Best Known Solution) values using TSPLIB.
Keywords
- TSP
- genetic algorithm
- max-min ant system algorithm
- hybrid algorithm
How to Cite
Tuncay Aydoğan and Raed Al-Badri, "A Hybrid Model Of Max-Min Ant System with Genetic Algorithm For Improved To Travelling Salesman Problem," International Journal of Engineering and Technology, vol. 10, no. 3, pp. 254-258, 2018. https://doi.org/ 10.7763/IJET.2018.V10.1069
Copyright & License
Copyright © 2018 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).