The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the \textit{q}-stripe TSP with $q \geq 1$, the objective function sums the costs for travelling from one customer to each of the next \textit{q} customers along the tour. The resulting \textit{q}-stripe TSP generalizes the TSP and forms a special case of the Quadratic Assignment Problem. To solve medium and large size instances, a metaheuristic algorithm is proposed. The proposed algorithm has two main components, which are construction and improvement phases. The construction phase generates a solution using Greedy Randomized Adaptive Search Procedure (GRASP) while the optimization phase improves the solution with several variants of Variable Neighborhood Search, both coupled with a technique called Shaking Technique to escape from local optima. In addition, Adaptive Memory is integrated into our algorithms to balance between the diversification and intensification. To show the efficiency of our proposed metaheuristic algorithms, we extensively experiment on benchmark instances. The results indicate that the developed algorithms can produce efficient and effective solutions at a reasonable computation time.
EFFICIENT METAHEURISTIC ALGORITHMS FOR THE MULTI-STRIPE TRAVELLING SALESMAN PROBLEM
