Variable Neighbourhood Search for Bi-Objective Travelling Thief Problem

Abstract

In this paper, Travelling Thief Problem (TTP) which is a hybridization of two well-known hard optimization problems-namely Travelling salesman problem and Knapsack Problem, is dealt using metaheuristic approach. We have designed and implemented Variable Neighbourhood Search, a widely used metaheuristic, to tackle TTP. The results indicate comparable performance with the available best-known work for TTP.