Many real-world optimization problems have multiple interacting components. Each of these
can be an NP-hard problem, and they can be in conflict with each other, ie, the optimal …

Real-world optimization problems often consist of several NP-hard optimization problems
that interact with each other. The goal of this paper is to provide a benchmark suite that …

In this paper, we propose a method to solve a bi-objective variant of the well-studied
traveling thief problem (TTP). The TTP is a multi-component problem that combines two …

Abstract The Travelling Thief Problem (TTP) is a novel problem that aims to provide a
benchmark model of combinatorial optimization problems with multiple interdependent …

Real-World problems usually consist of several different small sub-problems interacting with
each other. These interactions promote a relation of interdependence, where the quality of a …

The Travelling Thief Problem (TTP) is an optimization problem introduced in order to provide
a more realistic model for real-world optimization problems. The problem combines the …

This research proposes a novel indicator-based hybrid evolutionary approach that combines
approximate and exact algorithms. We apply it to a new bi-criteria formulation of the …

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 …

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 …

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 …