.png){kind=icon}
.png){kind=icon}
Return
An inverse model-guided two-stage evolutionary algorithm for multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2023.120198.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The estimation of distribution algorithm (EDA) is a kind of distinctive evolutionary algorithm that generates candidate solutions by directly sampling on distribution models. In this paper, we propose a distribution model -guided two-stage evolutionary algorithm for better solving multi-objective optimization problems (MOPs). To enhance modeling efficiency, the clustering method is employed to divide the population into multiple sub -populations. Then multivariate inverse models mapping from the objective space to the decision space are constructed by using a single decision variable and two objectives from each subpopulation. Then offspring are generated by randomly sampling the global and local objective space using the constructed inverse models. Moreover, a two-stage framework is proposed for better quality, i.e., convergence and diversity, of the solution set. In the first stage, exploration is mainly considered, during which the population converge rapidly. And exploitation is emphasized in the second stage, where the solution set is tuned by a replacement strategy. Experimental studies with several peer competitors on a set of widely-used benchmark MOPs as well as an en-gineering design MOP verify the competitiveness of the proposed method.
Keywords:
Multi -objective optimization
Inverse model
Multistage optimization
Exploration and exploitation
Engineering design
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W