Answers are grounded in this paper and cite their sources.
Real-world problems often comprise multiple interdependent sub-problems. The interdependency between sub-problems makes the original problem complex. The Travelling Thief Problem (TTP), an exemplary representation of such a multi-component optimisation problem, is introduced in the literature with sheer academic interest. TTP, a combination of the Travelling Salesman Problem and the Knapsack Problem, has drawn much attention over the past few years. Several variants of TTP have also been developed and studied extensively. The literature around TTP has been increasing consistently. This growing interest motivates us to present a systematic overview of the existing literature. To the best of our knowledge, this is the first attempt towards a systematic literature review on TTP. This paper surveys TTP, Packing While Travelling (PWT), Thief Orienteering Problem (ThOP), and their associated operations, analysing 68 articles. With the evolution of logistics, TTP and ThOP find more relevance in pick-up and delivery services (including courier & recyclable-goods collection). The study comprehensively covers TTP variants (i.e. mono & bi-objective TTP, multiple & dynamic TTP, PWT) and ThOP. Subsequently, state-of-the-art TTP and ThOP solution methodologies are reviewed and classified into exact, heuristic, meta-heuristic, and hyper-heuristic methods. Finally, research gaps and future research opportunities are delineated for TTP and ThOP.
No takes yet. Share an insight, caveat, or question.
Sarkar et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: