Mathematical Conferences Niš, Serbia, 13th Serbian Mathematical Congress

Font Size: 
Genetic Algorithm and Local Search Hybridization to Solve Traveling Salesman Problem
Marjan Kuchaki Rafsanjani, E Eskandari, A Borumand Saeid

Last modified: 2014-03-13

Abstract


 In this study, a new hybridization of GA and local search based on a new similarity-based control mechanism is proposed and its behavior on different TSP instances is compared with simple GA. The experimental results show that the proposed hybrid algorithm yields the optimal tour length in most of the cases, especially in the TSP instances with higher complexity.