Project Details
Description
Evolutionary multiobjective optimization (EMO) is one of the most active research areas
in evolutionary computation and multiple criteria decision making. Multiobjective
evolutionary algorithm based on decomposition (MOEA/D), which bridges the traditional
techniques and population-based methods, has been widely accepted as one of the three
major EMO frameworks and been successfully applied in various domains. However, a
number of fundamental issues, such as 1) how to select solution for each subproblem, 2)
how to handle decision maker (DM)’s preferences, and 3) how to mate parents for
offspring generation, still need to be addressed before this approach can be widely
accepted and used in industry. In principle, all these three issues can be regarded as
matching problems, which are subproblem-solution, preference-solution and solution-solution
matching, respectively.Stable matching theory, first proposed and studied in a Nobel Prize winning paper, can
effectively resolve conflicts of interests among selfish agents in the market. In this
research, focusing on the aforementioned three issues, we will develop and investigate
EMO methodologies from the perspective of stable matching theory. Specifically, we will
first develop a novel selection strategy, which assigns each subproblem with its
appropriate solution, based on a stable marriage model (one-to-one matching) under
certain fairness criteria. Then, we will extend the stable marriage model, used for
selection strategy, from a one-to-one matching to a many-to-one matching, and apply
it to accommodate DM’s preferences. Finally, we will develop a novel mating scheme,
which can balance the exploration and exploitation of the evolutionary search, based on
a many-to-many matching model. It is more general than the one-to-one and many-to-
one matchings.In the long run, this research will bring a completely new approach for designing and
analyzing EMO methodologies in a systematic and rational manner. Moreover, its
significant impacts are not only limited to the developments of EMO, but also to the
design and analysis of other evolutionary search methods, metaheuristics and even
traditional optimization. In the meanwhile, its outputs will provide more powerful tools
for real-life optimization problems.
| Project number | 9042038 |
|---|---|
| Grant type | GRF |
| Status | Finished |
| Effective start/end date | 1/01/15 → 21/12/18 |
Keywords
- MOEA/D,Evolutionary Algorithms,Multiobjective optimization,Stable Matching theory,
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
Research output
- 7 RGC 21 - Publication in refereed journal
-
Hashing-Based Undersampling Ensemble for Imbalanced Pattern Classification Problems
Ng, W. W. Y., Xu, S., Zhang, J., Tian, X., Rong, T. & Kwong, S., Feb 2022, In: IEEE Transactions on Cybernetics. 52, 2, p. 1269-1279Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
59 Link opens in a new tab Citations (Scopus) -
ASIF-Net: Attention Steered Interweave Fusion Network for RGB-D Salient Object Detection
Li, C., Cong, R., Kwong, S., Hou, J., Fu, H., Zhu, G., Zhang, D. & Huang, Q., Jan 2021, In: IEEE Transactions on Cybernetics. 51, 1, p. 88-100Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
243 Link opens in a new tab Citations (Scopus) -
HELP: An LSTM-based approach to hyperparameter exploration in neural network learning
Li, W., Y. Ng, W. W., Wang, T., Pelillo, M. & Kwong, S., 28 Jun 2021, In: Neurocomputing. 442, p. 161-172Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
64 Link opens in a new tab Citations (Scopus)