Are All the Subproblems Equally Important? Resource Allocation in Decomposition-Based Multiobjective Evolutionary Algorithms

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal

11 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number7088618
Pages (from-to)52-64
Journal / PublicationIEEE Transactions on Evolutionary Computation
Volume20
Issue number1
StatePublished - 1 Feb 2016

Abstract

Decomposition-based multiobjective evolutionary algorithms (MOEAs) decompose a multiobjective optimization problem into a set of scalar objective subproblems and solve them in a collaborative way. A naïve way to distribute computational effort is to treat all the subproblems equally and assign the same computational resource to each subproblem. This paper proposes a generalized resource allocation (GRA) strategy for decomposition-based MOEAs by using a probability of improvement vector. Each subproblem is chosen to invest according to this vector. An offline measurement and an online measurement of the subproblem hardness are used to maintain and update this vector. Utility functions are proposed and studied for implementing a reasonable and stable online resource allocation strategy. Extensive experimental studies on the proposed GRA strategy have been conducted.

Research Area(s)

  • Decomposition, multiobjective optimization, resource allocation

Citation Format(s)

Are All the Subproblems Equally Important? Resource Allocation in Decomposition-Based Multiobjective Evolutionary Algorithms. / Zhou, Aimin; Zhang, Qingfu.

In: IEEE Transactions on Evolutionary Computation, Vol. 20, No. 1, 7088618, 01.02.2016, p. 52-64.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal