An enhanced hybrid genetic algorithm for solving traveling salesman problem

Zeravan Arif Ali (Department at Duhok Polytechnic University)
Subhi Ahmed Rasheed (Department at Duhok Polytechnic University)
Nabeel No’man Ali (Department at Duhok Polytechnic University)

Indonesian Journal of Electrical Engineering and Computer Science
Vol 18, No 2: May 2020

Robust known the exceedingly famed NP-hard problem in combinatorial optimization is the Traveling Salesman Problem (TSP), promoting the skillful algorithms to get the solution of TSP have been the burden for several scholars. For inquiring global optimal solution, the presented algorithm hybridizes genetic and local search algorithm to take out the uplifted quality results. The genetic algorithm gives the best individual of population by enhancing both cross over and mutation operators while local search gives the best local solutions by testing all neighbor solution. By comparing with the conventional genetic algorithm, the numerical outcomes acts that the presented algorithm is more adequate to attain optimal or very near to it. Problems arrested from the TSP library strongly trial the algorithm and shows that the proposed algorithm can reap outcomes within reach optimal. For more details, please download TEMPLATE HELP FILE from the website.