Return
Stable Matching-Based Selection in Evolutionary Multiobjective Optimization
DOI:10.1109/TEVC.2013.2293776.png)
Abstract
En 中文
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem into a set of scalar optimization subproblems and optimizes them in a collaborative manner. Subproblems and solutions are two sets of agents that naturally exist in MOEA/D. The selection of promising solutions for subproblems can be regarded as a matching between subproblems and solutions. Stable matching, proposed in economics, can effectively resolve conflicts of interests among selfish agents in the market. In this paper, we advocate the use of a simple and effective stable matching (STM) model to coordinate the selection process in MOEA/D. In this model, subproblem agents can express their preferences over the solution agents, and vice versa. The stable outcome produced by the STM model matches each subproblem with one single solution, and it tradeoffs convergence and diversity of the evolutionary search. Comprehensive experiments have shown the effectiveness and competitiveness of our MOEA/D algorithm with the STM model. We have also demonstrated that user-preference information can be readily used in our proposed algorithm to find a region that decision makers are interested in.
Keywords:
Decomposition
deferred acceptance procedure
multiobjective evolutionary algorithm based on decomposition (MOEA/D)
multiobjective optimization
preference incorporation
stable matching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
Cited Papers
Geochemistry of basalts from IODP site U1365: Implications for magmatism and mantle source signatures of the mid-Cretaceous Osbourn Trough
Lithos
IF0
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States
PLoS ONE
IF0

