Many evolutionary and constructive heuristic approaches have been introduced in order to
solve the Travelling Thief Problem (TTP). However, the accuracy of such approaches is …

Many real-world problems are composed of multiple interacting sub-problems. However, few
investigations have been carried out to look into tackling problems from a metaheuristics …

Many real-world problems are composed of several interacting components. In order to
facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in …

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 …

Given a set of cities, each containing several items, or objects, with a specific profit and
weight associated with each object, the Travelling Thief Problem (TTP) requires a thief with a …

In many real-world applications, one needs to deal with a large multi-silo problem with
interdependent silos. In order to investigate the interdependency between silos …

Hyper-heuristics are high-level search techniques which improve the performance of
heuristics operating at a higher heuristic level. Usually, these techniques automatically …

Abstract The Traveling Thief Problem (TTP) is a novel problem that combines the well-
known Traveling Salesman Problem (TSP) and Knapsack Problem (KP). In this paper, the …

Many real-world problems are composed of two or more problems that are interdependent
on each other. The interaction of such problems usually is quite complex and solving each …

The traveling thief problem (TTP) is fast gaining attention for being a challenging
combinatorial optimization problem. A number of algorithms have been proposed for solving …