Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms

This publication investigates characteristics of and algorithms for the quite new and complex Bi-Objective Traveling Thief Problem, where the well-known Traveling Salesman Problem and Binary Knapsack Problem interact. The interdependence of these two components builds an interwoven system where solving one subproblem separately does not solve the overall problem. The objective space of the Bi-Objective Traveling Thief Problem has through the interaction of two discrete subproblems some interesting properties which are investigated. We propose different kind of algorithms to solve the Bi-Objective Traveling Thief Problem. The first proposed deterministic algorithm picks items on tours calculated by a Traveling Salesman Problem Solver greedily. As an extension, the greedy strategy is substituted by a Knapsack Problem Solver and the resulting Pareto front is locally optimized. These methods serve as a references for the performance of multi-objective evolutionary algorithms. Additional experiments on evolutionary factory and recombination operators are presented. The obtained results provide insights into principles of an exemplary bi-objective interwoven system and new starting points for ongoing research.

[1]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[2]  Xiaodong Li,et al.  On investigation of interdependence between sub-problems of the Travelling Thief Problem , 2016, Soft Comput..

[3]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[4]  Verfassung der Arbeit,et al.  Solving The Travelling Thief Problem with an Evolutionary Algorithm , 2015 .

[5]  Zbigniew Michalewicz,et al.  A comprehensive benchmark set and heuristics for the traveling thief problem , 2014, GECCO.

[6]  Xiaodong Li,et al.  Heuristic evolution with genetic programming for traveling thief problem , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[7]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[8]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[9]  Xiaodong Li,et al.  Improving Efficiency of Heuristics for the Large Scale Traveling Thief Problem , 2014, SEAL.

[10]  M. Lagoudakis.  The 0 – 1 Knapsack Problem An Introductory Survey , 1996 .

[11]  Markus Wagner,et al.  Approximate Approaches to the Traveling Thief Problem , 2015, GECCO.

[12]  Rasmus Birkedal.  Design , Implementation and Comparison of Randomized Search Heuristics for the Traveling Thief Problem , 2015 .

[13]  Adam Wierzbicki,et al.  Socially inspired algorithms for the travelling thief problem , 2014, GECCO.

[14]  Aravind Seshadri,et al.  A FAST ELITIST MULTIOBJECTIVE GENETIC ALGORITHM: NSGA-II , 2000 .

[15]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[16]  Carlos M. Fonseca,et al.  The Attainment-Function Approach to Stochastic Multiobjective Optimizer Assessment and Comparison , 2010, Experimental Methods for the Analysis of Optimization Algorithms.

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

[18]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[19]  Günter Rudolph,et al.  Multiobjective optimization for interwoven systems , 2017 .

[20]  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.