The travelling thief problem: The first step in the transition from theoretical problems to realistic problems
- 1 June 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 1037-1044
Abstract
There are some questions concerning the applicability of meta-heuristic methods for real-world problems; further, some researchers claim there is a growing gap between research and practice in this area. The reason is that the complexity of real-world problems is growing very fast (e.g. due to globalisation), while researchers experiment with benchmark problems that are fundamentally the same as those of 50 years ago. Thus there is a need for a new class of benchmark problems that reflect the characteristics of real-world problems. In this paper, two main characteristics of real-world problems are introduced: combination and interdependence. We argue that real-world problems usually consist of two or more sub-problems that are interdependent (to each other). This interdependence is responsible for the complexity of the real-world problems, while the type of complexity in current benchmark problems is missing. A new problem, called the travelling thief problem, is introduced; it is a combination of two well-known problems, the knapsack problem and the travelling salesman problem. Some parameters which are responsible for the interdependence of these two sub-problems are defined. Two sets of parameters are introduced that result in generating two instances of the travelling thief problem. The complexities that are raised by interdependences for these two instances are discussed in detail. Finally, a procedure for generating these two instances is given.Keywords
This publication has 17 references indexed in Scilit:
- Combining vehicle routing and packing for optimal delivery schedules of water tanksOR Insight, 2013
- Evolutionary approaches for supply chain optimisation. Part II: multi‐silo supply chainsInternational Journal of Intelligent Computing and Cybernetics, 2012
- Combinatorial Traveling Salesman Problem Algorithms2011
- Comparison of cooperative and classical evolutionary algorithms for global supply chain optimisation2010
- Heuristics for the 0–1 multidimensional knapsack problemEuropean Journal of Operational Research, 2009
- A Bipartite Genetic Algorithm for Multi-processor Task SchedulingInternational Journal of Parallel Programming, 2009
- Multidimensional Knapsack Problem: A Fitness Landscape AnalysisIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2008
- An efficient preprocessing procedure for the multidimensional 0–1 knapsack problemDiscrete Applied Mathematics, 1994
- A heuristic solution procedure for the multiconstraint zero-one knapsack problemNaval Research Logistics (NRL), 1987
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965