The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

Abstract EN

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters.

The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order.

The problem is NP-hard, and it arises in practical transportation and sequencing problems.

This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem.

The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes.

The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time.

Finally, we present solution to some more symmetric TSPLIB instances.