Journal of Engineering and Applied Sciences

97
Views

0
Downloads

Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and Firefly Algorithm

Ameera Jaradat and Moy’awiah Al-Shannaq
Page: 8379-8385 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

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.

How to cite this article:

Ameera Jaradat and Moy’awiah Al-Shannaq. Solving Travelling Salesman Problem with a Hybrid Genetic Algorithm and Firefly Algorithm.
DOI: https://doi.org/10.36478/jeasci.2019.8379.8385
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2019.8379.8385