Moy’awiah  Al-Shannaq, Ameera  Jaradat, 
    Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and
Firefly Algorithm,
    Journal of Engineering and Applied Sciences,
    Volume 14,Issue 22,
    2019,
    Pages 8379-8385,
    ISSN 1816-949x,
    jeasci.2019.8379.8385,
    (https://makhillpublications.co/view-article.php?doi=jeasci.2019.8379.8385)
    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.
    Keywords: hybridapproach;Firefly Algorithm (FA);Genetic Algorithm (GA);Travelling Salesman Problem (TSP);metaheuristics;swarm intelligence