Please use this identifier to cite or link to this item:
Title: Improved adaptive global replacement scheme for MOEA/D-AGR
Authors: Tam, HH
Leung, MF
Wang, Z
Ng, SC
Cheung, CC
Lui, AK
Keywords: Adaptive scheme
Fuzzy logic
Local search
Multi-objective optimization
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: 2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016, 7744054, p. 2153-2160 How to cite?
Abstract: Multi-Objective Evolutionary Algorithm based on decomposition (MOEA/D) has been proposed for a decade in solving complex multi-objective problems (MOP) by decomposing it into a set of single-objective problems. MOEA/D-AGR is one of the improved algorithm introduced recently to substitute the original replacement scheme in MOEA/D with a new adaptive global replacement (GR) scheme so that the neighborhood replacement size Tr is increased among the generation to achieve the shifting of focus from solution diversity to convergence. However, the new replacement scheme only considers the one-way convergence of the objective solutions among all sub-problems. It is hard to re-achieve the solution diversity once the algorithm reaches another steeper landscape of solution from a flatten one while it is focusing on convergence. This paper proposes a new adaptive GR scheme to prolong the period of Tr increment so that it can fit the re-increment of fitness landscape. To compensate the shorten period for solution convergence, local searching is adapted for those individuals which has stopped improving its solution value by Simulated Annealing (SA) algorithm. In order to suppress the degree of local searching at the early stage of focusing solution diversity, Fuzzy Logic is used here to coordinate the frequency of local searching according to the average change of objective solution values. To demonstrate the performance of the proposed algorithm, several common benchmark MOPs are used in this paper for comparing with the several state-of-the-art MOEA/D algorithms in terms of IGD. The performance investigation found that the performance of the proposed algorithm was generally better than the other compared algorithms.
Description: 2016 IEEE Congress on Evolutionary Computation, CEC 2016, Vancouver, Canada, 24-29 July 2016
ISBN: 9781509006229
DOI: 10.1109/CEC.2016.7744054
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jan 8, 2019

Page view(s)

Last Week
Last month
Citations as of Jan 13, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.