Authors : Moy’awiah Al-Shannaq and Ameera Jaradat
Abstract: The Problem of Travelling Salesman (TSP) is considered one of the most significant optimization problems. The problem is classified as NP-hard. A new, hybrid Firefly Algorithm (FA) and Genetic Algorithm (GA) strategy are brought together. The approach is implemented and tested on the TSP. Experiment results show that the hybrid approach produces a better route when compared to (FA and GA) for the same number of iterations.
Moy’awiah Al-Shannaq and Ameera Jaradat, 2019. Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and Firefly Algorithm. Journal of Engineering and Applied Sciences, 14: 8379-8385.