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

Mengyuan WU; Sam KWONG; Qingfu ZHANG; Ke LI; Ran WANG; Bo LIU

doi:10.1109/SMC.2015.302

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

Mengyuan WU, Sam KWONG, Qingfu ZHANG, Ke LI, Ran WANG, Bo LIU

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

8 Citations (Scopus)

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 language	English
Title of host publication	The 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015
Publisher	IEEE
Pages	1720-1725
Number of pages	6
ISBN (Electronic)	9781479986972
DOIs	https://doi.org/10.1109/SMC.2015.302
Publication status	Published - Oct 2015
Externally published	Yes
Event	IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015 - Kowloon Tong, Hong Kong Duration: 9 Oct 2015 → 12 Oct 2015

Conference

Conference	IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015
Abbreviated title	SMC 2015
Country/Territory	Hong Kong
City	Kowloon Tong
Period	9/10/15 → 12/10/15

Access to Document

10.1109/SMC.2015.302

Cite this

@inproceedings{97efe58c915c4376907d1e2d347c5196,

title = "Two-Level Stable Matching-Based Selection in MOEA/D",

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.",

author = "Mengyuan WU and Sam KWONG and Qingfu ZHANG and Ke LI and Ran WANG and Bo LIU",

year = "2015",

month = oct,

doi = "10.1109/SMC.2015.302",

language = "English",

pages = "1720--1725",

booktitle = "The 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015",

publisher = "IEEE",

note = "IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015, SMC 2015 ; Conference date: 09-10-2015 Through 12-10-2015",

}

TY - GEN

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

AU - WU, Mengyuan

AU - KWONG, Sam

AU - ZHANG, Qingfu

AU - LI, Ke

AU - WANG, Ran

AU - LIU, Bo

PY - 2015/10

Y1 - 2015/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964492583&partnerID=8YFLogxK

U2 - 10.1109/SMC.2015.302

DO - 10.1109/SMC.2015.302

M3 - Conference paper (refereed)

SP - 1720

EP - 1725

BT - The 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015

PB - IEEE

T2 - IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015

Y2 - 9 October 2015 through 12 October 2015

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this