A novel imperialist competitive algorithm for generalized traveling salesman problems

This paper deals with generalized traveling salesman problems. In this problem, all nodes are partitioned into some clusters and each cluster must be visited exactly once in a tour. We present an effective metaheuristic method hybridized with a local search procedure to solve this problem. The proposed algorithm is based on the imperialist competitive algorithm (ICA), which is a new socio-politically motivated global search strategy. ICA is enhanced by a novel encoding scheme, assimilation policy procedure, destruction/construction operator and imperialist development plans. Various parameters of the algorithm are analyzed to calibrate the algorithm by means of the Taguchi method. For the evaluation of the proposed algorithm, it is compared against two effective existing algorithms through a set of available instances. The results demonstrate the superiority of our algorithm in both solution quality and robustness of the solution. (C) 2014 Elsevier B.V. All rights reserved.