We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelope-based
Selection Algorithm), in which selection and diversity maintenance are controlled via …

A Very Large Scale Integrated-circuit (VLSI) floorplan can be represented in an ordered tree
(O-tree), and therefore the VLSI floorplan optimization problem can be transformed into an O …

We introduce a simple evolution scheme for multiobjective optimization problems, called the
Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the …

We describe a new selection technique for evolutionary multiobjective optimization algorithms
in which the unit of selection is a hyperbox in objective space. In this technique, instead of …

Most popular evolutionary algorithms for multiobjective optimisation maintain a population of
solutions from which individuals are selected for reproduction. In this paper, we introduce a …

… David W. Corne lectures and consults in EC at the University of Reading. His early research
on evolutionary timetabling (with Peter Ross) resulted in the first freely available and …

The research area of evolutionary multiobjective optimization (EMO) is reaching better
understandings of the properties and capabilities of EMO algorithms, and accumulating much …

Evolutionary multiobjective optimization (EMO) boasts a proliferation of algorithms and
benchmark problems. We need principled ways to compare the performance of different EMO …

A memetic algorithm for tackling multiobjective optimization problems is presented. The
algorithm employs the proven local search strategy used in the Pareto archived evolution …

One common characterization of how simple hill-climbing optimization methods can fail is
that they become trapped in local optima - a state where no small modification of the current …