This chapter provides an annotated bibliography of multiple objective combinatorial
optimization, MOCO. We present a general formulation of MOCO problems, describe their …

In recent years, a gradual increase in the sophistication of multiobjective evolutionary
algorithms (MOEAs) for Pareto optimization has been seen, accompanied by an ever …

In this paper we present a review of approximative solution methods, that is, heuristics and
metaheuristics designed for the solution of multiobjective combinatorial optimization …

More and more companies in the routing industry are providing consistent service to gain
competitive advantage. However, improved service consistency comes at the price of higher …

We consider in this paper the solving of 0-1 knapsack problems with multiple linear
objectives. We present a tabu search approach to generate a good approximation of the …

The difficulty of solving a multi-objective optimization problem is impacted by the number of
objectives to be optimized. The presence of many objectives typically introduces a number …

This book presents an overview of several archiving strategies we have developed over the
last years dealing with approximations of the solution sets of multi-objective optimization …

In this paper, we propose a new method called ND-Tree-based update (ND-Tree) for the
dynamic nondominance problem, ie, the problem of online update of a Pareto archive …

Multi-criteria optimisation problems occur naturally in many engineering practices. Pareto
analysis has proven to be a powerful tool to characterise potentially interesting realisations …

In this paper an interactive procedure based upon a data structure called a quad tree is
developed for solving the discrete alternative multiple criteria problem. Called InterQuad, the …