A Comparison of Algorithms for Solving Multicomponent Optimization Problems

Real-world problems are often composed of multiple interdependent components. In this case, benchmark problems that do not represent that interdependency are not a good choice to assess algorithm performance. In recently literature, a benchmark problem called Travelling Thief Problem (TTP) was proposed to better represent real-world multicomponent problems. TTP is a combination of two well-known problems: 0-1 Knapsack Problem and the Travelling Salesman Problem. This paper presents a comparison among three optimization approaches for solving TTP. The comparisons are performed on 60 representative small TTP instances available in the literature.