@article{MAKHILLJEAS2019142218622,
    title = {Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and
Firefly Algorithm},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {22},
    pages = {8379-8385},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.8379.8385},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.8379.8385},
    author = {Moy’awiah and},
    keywords = {hybridapproach,Firefly Algorithm (FA),Genetic Algorithm (GA),Travelling Salesman Problem (TSP),metaheuristics,swarm intelligence},
    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.}
    }