Can I read Solving Travelling Thief Problems using Coordination Based Methods on EtoBox?

Solving Travelling Thief Problems using Coordination Based Methods by Namazi, Majid; Newton, M. A. Hakim; Sanderson, Conrad; Sattar, Abdul is a scholarly article available to read on EtoBox.

What is Solving Travelling Thief Problems using Coordination Based Methods about?

A travelling thief problem (TTP) is a proxy to real-life problems such as postal collection. TTP comprises an entanglement of a travelling salesman problem (TSP) and a knapsack problem (KP) since items of KP are scattered over cities of TSP, and a thief has to visit cities to collect items. In TTP, city selection and item selection decisions need close coordination since the thief's travelling speed depends on the knapsack's weight and the order of visiting cities affects the order of item collection. Existing TTP solvers deal with city selection and item selection separately, keeping decisions for one type unchanged while dealing with the other type. This separation essentially means very poor coordination between two types of decision. In this paper, we first show that a simple local search based coordination approach does not work in TTP. Then, to address the aforementioned problems, we propose a human designed coordination heuristic that makes changes to collection plans during exploration of cyclic tours. We further propose another human designed coordination heuristic that explicitly exploits the cyclic tours in item selections during collection plan exploration. Lastly, we p

Author

Namazi, Majid; Newton, M. A. Hakim; Sanderson, Conrad; Sattar, Abdul

Published

2023

Language

EN