Automated aggregation and omission of objectives for tackling many-objective problems

Abstract

Many-objective problems pose various challenges in terms of decision making and search. One approach to tackle the resulting problems is the automatic reduction of the number of objectives such that the information loss is minimized. While in a previous work we have investigated the issue of omitting objectives, we here address the generalized problem of aggregating objectives using weighted sums. To this end, heuristics are presented that iteratively remove two objectives and replace them by a new objective representing an optimally weighted combination of them. As shown in the paper, the new reduction method can substantially reduce the information loss and thereby can be highly useful when analyzing trade-off sets after optimization as well as during search to reduce the computation overhead related to hypervolume-based fitness assignment. © Springer-Verlag Berlin Heidelberg 2010.