Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem

Chemical Reaction Optimization (CRO) is a new heuristic optimization method mimicking the process of a chemical reaction where molecules interact with each other aiming to reach the minimum state of free energy. CRO has demonstrated its capability in solving NP-hard optimization problems. The Lin-Kernighan(LK) local search is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). In this paper, we present a hybrid algorithm based on CRO and LK local search for TSP. The proposed algorithm consider the tradeoff between the exploration abilities of CRO and the exploitation abilities of LK local searcher. Experimental results show that the proposed algorithm is efficient.