A cone order sequence based multi-objective evolutionary algorithm

Yueming Lyu*, Qingfu Zhang, Ka-Chun Wong

*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

3 Citations (Scopus)

Abstract

A cone order sequence based MOEA (CS-MOEA) is proposed to deal with the multi-objective optimization problems. Instead of only using the Pareto dominance, it constructs a sequence of cone order to balance the search diversity and convergence. By gradually increasing the open angle of the cone order, it approximates the Pareto cone gradually. A simple formula for judging the θ-cone dominance is derived, which is easy to be computed. Moreover, an energy model is introduced for the selection of individuals to maintain population diversity. Experiments on more than 10 problems (i.e. zdt and dtlz benchmark problem sets) demonstrate that the proposed method is competitive, compared with Stable Matching MOEA/D (STM-MOEA/D) and MOEA/D-DE.
Original languageEnglish
Title of host publication2016 IEEE Congress on Evolutionary Computation, CEC 2016
PublisherIEEE
Pages2169-2176
ISBN (Print)9781509006229
DOIs
Publication statusPublished - 14 Nov 2016
Event2016 IEEE Congress on Evolutionary Computation, CEC 2016 - Vancouver, Canada
Duration: 24 Jul 201629 Jul 2016

Publication series

NameIEEE Congress on Evolutionary Computation
PublisherIEEE

Conference

Conference2016 IEEE Congress on Evolutionary Computation, CEC 2016
PlaceCanada
CityVancouver
Period24/07/1629/07/16

Research Keywords

  • DECOMPOSITION
  • OPTIMIZATION
  • HYPERVOLUME
  • SELECTION
  • DIVERSITY

Fingerprint

Dive into the research topics of 'A cone order sequence based multi-objective evolutionary algorithm'. Together they form a unique fingerprint.

Cite this