Skip to main navigation Skip to search Skip to main content

Two-Level Stable Matching-Based Selection in MOEA/D

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

Abstract

Stable matching-based selection models the selection process in MOEA/D as a stable marriage problem. By finding a stable matching between the sub problems and solutions, the solutions are assigned to sub problems to balance the convergence and the diversity. In this paper, a two-level stable matching-based selection is proposed to further guarantee the diversity of the population. More specifically, the first level of stable matching only matches a solution to one of its most preferred sub problems and the second level of stable matching is responsible for matching the solutions to the remaining sub problems. Experimental studies demonstrate that the proposed selection scheme is effective and competitive comparing to other state-of-The-Art selection schemes for MOEA/D.
Original languageEnglish
Title of host publicationProceedings - The 2015 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2015)
PublisherIEEE
Pages1720-1725
ISBN (Electronic)978-1-4799-8697-2
DOIs
Publication statusPublished - Oct 2015
EventThe 2015 IEEE International Conference on Systems, Man, and Cybernetics (SMC2015) - Hong Kong , Hong Kong, China
Duration: 9 Oct 201512 Oct 2015

Conference

ConferenceThe 2015 IEEE International Conference on Systems, Man, and Cybernetics (SMC2015)
PlaceHong Kong, China
CityHong Kong
Period9/10/1512/10/15

Fingerprint

Dive into the research topics of 'Two-Level Stable Matching-Based Selection in MOEA/D'. Together they form a unique fingerprint.

Cite this