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

Wu, M., Kwong, S., Zhang, Q., Li, K., Wang, R. and Liu, B. (2015) Two-Level Stable Matching-Based Selection in MOEA/D. In: 2015 IEEE International Conference on Systems, Man, and Cybernetics, Kowloon, China, 09-12 Oct 2015, pp. 1720-1725. ISBN 9781479986972 (doi: 10.1109/SMC.2015.302)

Full text not currently available from Enlighten.


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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Liu, Dr Bo
Authors: Wu, M., Kwong, S., Zhang, Q., Li, K., Wang, R., and Liu, B.
College/School:College of Science and Engineering > School of Engineering

University Staff: Request a correction | Enlighten Editors: Update this record