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 …

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 …

In real-world optimisation, it is common to face several sub-problems interacting and forming
the main problem. There is an inter-dependency between the sub-problems, making it …

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 …

There has been a growing interest in the evolutionary computation community to compute a
diverse set of high-quality solutions for a given optimisation problem. This can provide the …

In this paper, we investigate the use of hyper-heuristics for the travelling thief problem (TTP).
TTP is a multi-component problem, which means it has a composite structure. The problem …

Real-world problems often consist of several interdependent subproblems. The degree of
interaction of the subproblems is associated with the complexity of the problem and solving …

Abstract The Thief Orienteering Problem (ThOP) is a multi-component problem that
combines features of two classic combinatorial optimization problems: Orienteering Problem …

In recent years, Evolutionary Algorithms (EAs) have frequently been adopted to evolve
instances for optimization problems that pose difficulties for one algorithm while being rather …

The travelling thief problem (TTP) is a combination of two interdependent NP-hard
components: travelling salesman problem (TSP) and knapsack problem (KP). Existing …