| Traveling Salesman Problem and Knapsack Problem are perhaps the best-known combinatorial optimization problems that researchers have been racking their brains over for many decades. But they can also be combined into a single multi-component optimization problem, the Traveling Thief Problem, where the optimal solution for each single component does not necessarily correspond to an optimal Traveling Thief Problem solution. The aim of this work is to compare two generic algorithms for solving a Traveling Thief Problem independently of the test instance. |
*** Title, author list and abstract as seen in the Camera-Ready version of the paper that was provided to Conference Committee. Small changes that may have occurred during processing by Springer may not appear in this window.