TY  - JOUR
T1  - Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and
Firefly Algorithm
AU - Al-Shannaq, Moy’awiah AU - Jaradat, Ameera 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 22
SP  - 8379
EP  - 8385
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.8379.8385
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.8379.8385
KW  - hybridapproach
KW  -Firefly Algorithm (FA)
KW  -Genetic Algorithm (GA)
KW  -Travelling Salesman Problem (TSP)
KW  -metaheuristics
KW  -swarm intelligence
AB  - 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.
ER  -