On investigation of interdependence between sub-problems of the Travelling Thief Problem

In this paper, the interdependence between sub-problems in a complex overall problem is investigated using a benchmark problem called Travelling Thief Problem (TTP), which is a combination of Travelling Salesman Problem (TSP) and Knapsack Problem (KP). First, the analysis on the mathematical formulation shows that it is impossible to decompose the problem into independent sub-problems due to the non-linear relationship in the objective function. Therefore, the algorithm for TTP is not straightforward although each sub-problem alone has been investigated intensively. Then, two meta-heuristics are proposed for TTP. One is the Cooperative Co-evolution (CC) that solves the sub-problems separately and transfers the information between them in each generation. The other is the Memetic Algorithm (MA) that solves TTP as a whole. The comparative results showed that MA consistently obtained much better results than both the standard and dynamic versions of CC within comparable computational budget. This indicates the importance of considering the interdependence between sub-problems in an overall problem like TTP.

[1]  Sean Luke,et al.  Time-dependent Collaboration Schemes for Cooperative Coevolutionary Algorithms , 2005, AAAI Fall Symposium: Coevolutionary and Coadaptive Systems.

[2]  Xiaodong Li,et al.  Variable neighborhood decomposition for Large Scale Capacitated Arc Routing Problem , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[3]  Abdelkader Sbihi,et al.  A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem , 2010, Eur. J. Oper. Res..

[4]  Francisco Saldanha-da-Gama,et al.  Facility location and supply chain management - A review , 2009, Eur. J. Oper. Res..

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

[6]  Larry Bull.  On coevolutionary genetic algorithms , 2001, Soft Comput..

[7]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

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

[9]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[10]  Xin Yao,et al.  Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem , 2011, IEEE Transactions on Evolutionary Computation.

[11]  Mitchell A. Potter,et al.  The design and analysis of a computational model of cooperative coevolution , 1997 .

[12]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[13]  Xin Yao,et al.  Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems , 2009, IEEE Transactions on Evolutionary Computation.

[14]  Xiaodong Li,et al.  Decomposing Large-Scale Capacitated Arc Routing Problems using a random route grouping method , 2013, 2013 IEEE Congress on Evolutionary Computation.

[15]  Nikolaus Hansen,et al.  The CMA Evolution Strategy: A Comparing Review , 2006, Towards a New Evolutionary Computation.

[16]  Xiaodong Li,et al.  Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems , 2014, IEEE Transactions on Evolutionary Computation.

[17]  Stephen P. Boyd,et al.  Notes on Decomposition Methods , 2008 .

[18]  Xin Yao,et al.  Improved memetic algorithm for Capacitated Arc Routing Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[20]  Xin Yao,et al.  A Global Repair Operator for Capacitated Arc Routing Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[22]  Guenther Fuellerer,et al.  Metaheuristics for vehicle routing problems with three-dimensional loading constraints , 2010, Eur. J. Oper. Res..

[23]  Sean Luke,et al.  Archive-based cooperative coevolutionary algorithms , 2006, GECCO '06.

[24]  Xin Yao,et al.  Capacitated arc routing problem in uncertain environments , 2010, IEEE Congress on Evolutionary Computation.

[25]  Douglas J. Thomas,et al.  Coordinated supply chain management , 1996 .

[26]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[27]  Stefka Fidanova.  Ant Colony Optimization and Multiple Knapsack Problem , 2007 .

[28]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[29]  Yi Mei,et al.  Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem , 2010, IEEE Congress on Evolutionary Computation.

[30]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[31]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[32]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[33]  Xiaodong Li,et al.  Cooperative Co-Evolution With Differential Grouping for Large Scale Optimization , 2014, IEEE Transactions on Evolutionary Computation.

[34]  Xin Yao,et al.  A Memetic Algorithm for Periodic Capacitated Arc Routing Problem , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[35]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[36]  R. Paul Wiegand,et al.  An empirical analysis of collaboration methods in cooperative coevolutionary algorithms , 2001 .

[37]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[38]  Gilbert Laporte,et al.  A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars , 2010, Eur. J. Oper. Res..

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

[40]  Zbigniew Michalewicz,et al.  The travelling thief problem: The first step in the transition from theoretical problems to realistic problems , 2013, 2013 IEEE Congress on Evolutionary Computation.