The field of multiobjective evolutionary optimisation is one
of the hottest issues in evolutionary computation. The most
outstanding ability ofMOEAs is that they can explore a Pareto
front within one simulation run. This in combination with
their simplicity, robustness, and capability of dealing with all
kind of variables makes this kind of optimiser more popular
and attractive. MOEAs search mechanisms are based on a
population of design solutions, which work in such a way that
a population is evolved iteration by iteration. A matrix called
an external Pareto archive is used to collect nondominated
solutions iteratively. The Pareto archive is updated until a
termination criterion is fulfilled.TheMOEAs used for a comparative
performance test in this paper are given below.