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 …

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 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 …

Real-world problems complexity is often a consequence of the interdependence of the sub-
problems that compose them. The Travelling Thief Problem (TTP) is a novel benchmark …

Dynamic evolutionary multi-objective optimization is a thriving research area. Recent
contributions span the development of specialized algorithms and the construction of …

The present paper introduces a benchmark set reduction strategy that can degrade the
experimental evaluation cost for the algorithmic studies. Algorithm design is an iterative …

One characteristic feature of the traveling thief problem (TTP) is the existence of different
facets of instance difficulty that make no single optimization algorithm to excel over the …

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 a multi-component combinatorial optimization problem
that has gained significant attention in the evolutionary computation and heuristic search …

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 …