TITLE:
Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
AUTHORS:
Bao Lin, Xiaoyan Sun, Sana Salous
KEYWORDS:
Genetic Algorithm, Hybrid Local Search, TSP
JOURNAL NAME:
Journal of Computer and Communications,
Vol.4 No.15,
November
28,
2016
ABSTRACT: We present an improved hybrid genetic algorithm to solve the two-dimensional Eucli-dean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local search crossover operator and the double-bridge random mutation are highlighted, to enhance the convergence and the possibility of escaping from the local optima. The experimental results illustrate that the novel hybrid genetic algorithm outperforms other genetic algorithms by providing higher accuracy and satisfactory efficiency in real optimization processing.