n this paper
n this paper, a hybrid local search heuristic technique has been proposed. The experimental results show that our result is more promising in terms of quality and running time. The good performance of our proposed method for the large instance proves that the importance of making the assumptions of the problem when dealing with the multi-components problems. The actual characteristics of the TTP and how the optimal solution of each sub-problem effects the objective value of the TTP is the current research topic. Furthermore, we will improve our proposed method in terms of runtime and space exploration by using more sophisticated heuristics search.
The Travelling Thief Problem (TTP) is a novel problem that aims to provide a benchmark model of combi-natorial optimization problems with multiple interdependent components. The TTP combines two otherwell known benchmark problems: the Travelling Salesman Problem (TSP) and the Knapsack Problem(KP).