Metaheuristics are algorithms that have proven their efficiency on multi-objective
combinatorial optimisation problems. They often use local search techniques, either at their …

In hazardous materials distribution and recollection, economic, social and environmental
aspects need to be considered simultaneously. The stakeholders involved in these activities …

In this paper, a new multiple population based meta-heuristic to solve combinatorial
optimization problems is introduced. This meta-heuristic is called Golden Ball (GB), and it is …

The structure of the search space explains the behavior of multiobjective search algorithms,
and helps to design well-performing approaches. In this work, we analyze the properties of …

Pareto local search (PLS) is a natural extension of local search for multiobjective
combinatorial optimization problems (MCOPs). In our previous work, we improved the …

Most multiobjective optimization algorithms maintain an archive explicitly or implicitly during
their search. Such an archive can be solely used to store high-quality solutions presented to …

Automated algorithm configuration procedures play an increasingly important role in the
development and application of algorithms for a wide range of computationally challenging …

Abstract Pareto Local Search (PLS) is a simple and effective local search method for tackling
multi-objective combinatorial optimization problems. It is also a crucial component of many …

This paper introduces a multiobjective fleet size and mix location-routing problem with time
windows and designs a set of real-world benchmark instances. Then, two versions of …

In this paper, we show that when dealing with multi-objective combinatorial optimisation
problems, the search, in different executions of a multi-objective evolutionary algorithm …