Affordable Access

Benchmarking cost-assignment schemes for multi-objective evolutionary algorithms

Springer Berlin Heidelberg
Publication Date
  • Q Science (General)


Currently there exist various cost-assignment schemes that perform the necessary scalarization of the objective values when applied to a multi-objective optimization problem. Of course, the final decision depends highly on the nature of the problem but given the multiplicity of the schemes combined with the fact that what the user ultimately needs is a single compromise solution it is evident that elaborating the selection of the method is not a trivial task. This paper intends to address this problem by extending the benchmarks of optimality and reach time given in [1] to mutliobjective optimization problems. A number of existing cost-assignment schemes are evaluated using such benchmarks.

There are no comments yet on this publication. Be the first to share your thoughts.