Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation

The Travelling Thief Problem (TTP) is a challenging combinatorial optimization problem that attracts many scholars. The TTP interconnects two well-known NP-hard problems: the Travelling Salesman Problem (TSP) and the 0-1 Knapsack Problem (KP). Increasingly algorithms have been proposed for solving t...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Yang, Lei, Zhang, Zitong, Jia, Xiaotian, Kang, Peipei, Zhang, Wensheng, Wang, Dongya
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 16.12.2020
Subjects
Algorithms
Combinatorial analysis
Knapsack problem
Optimization
Traveling salesman problem
Online AccessGet full text

Cover

More Information
Summary:The Travelling Thief Problem (TTP) is a challenging combinatorial optimization problem that attracts many scholars. The TTP interconnects two well-known NP-hard problems: the Travelling Salesman Problem (TSP) and the 0-1 Knapsack Problem (KP). Increasingly algorithms have been proposed for solving this novel problem that combines two interdependent sub-problems. In this paper, TTP is investigated theoretically and empirically. An algorithm based on the score value calculated by our proposed formulation in picking items and sorting items in the reverse order in the light of the scoring value is proposed to solve the problem. Different approaches for solving the TTP are compared and analyzed; the experimental investigations suggest that our proposed approach is very efficient in meeting or beating current state-of-the-art heuristic solutions on a comprehensive set of benchmark TTP instances.
ISSN:2331-8422