The travelling thief problem: The first step in the transition from theoretical problems to realistic problems

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.

[1]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[2]  Franz Rothlauf,et al.  Design of Modern Heuristics , 2011, Natural Computing Series.

[3]  Raymond Chiong,et al.  Why Is Optimization Difficult? , 2009, Nature-Inspired Algorithms for Optimisation.

[4]  Andrea Lodi,et al.  Combinatorial Traveling Salesman Problem Algorithms , 2011 .

[5]  Maksud Ibrahimov,et al.  Evolutionary approaches for supply chain optimisation: Part I: single and two-component supply chains , 2012, Int. J. Intell. Comput. Cybern..

[6]  Arnaud Fréville,et al.  An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem , 1994, Discret. Appl. Math..

[7]  Zbigniew Michalewicz,et al.  Quo Vadis, Evolutionary Computation? - On a Growing Gap between Theory and Practice , 2012, WCCI.

[8]  Arvind Mohais,et al.  Combining vehicle routing and packing for optimal delivery schedules of water tanks , 2013, OR Insight.

[9]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[10]  F. Glover A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[11]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[12]  Mohammad Reza Bonyadi,et al.  A Bipartite Genetic Algorithm for Multi-processor Task Scheduling , 2009, International Journal of Parallel Programming.

[13]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Kenneth A. De Jong,et al.  A Cooperative Coevolutionary Approach to Function Optimization , 1994, PPSN.

[16]  Franz Rothlauf,et al.  Design of Modern Heuristics: Principles and Application , 2011 .

[17]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[18]  Zbigniew Michalewicz,et al.  Variants of Evolutionary Algorithms for Real-World Applications , 2011, Variants of Evolutionary Algorithms for Real-World Applications.

[19]  Didier El Baz,et al.  Heuristics for the 0-1 multidimensional knapsack problem , 2009, Eur. J. Oper. Res..

[20]  Ernesto Costa,et al.  Multidimensional Knapsack Problem: A Fitness Landscape Analysis , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[21]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[22]  Maksud Ibrahimov,et al.  Evolutionary approaches for supply chain optimisation. Part II: multi-silo supply chains , 2012, Int. J. Intell. Comput. Cybern..

[23]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[24]  Maksud Ibrahimov,et al.  Comparison of cooperative and classical evolutionary algorithms for global supply chain optimisation , 2010, IEEE Congress on Evolutionary Computation.

[25]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..