a new multiobjective evolutionary algorithm based on decomposition of the objective space for multiobjective optimization
Clicks: 6
ID: 244000
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
1.5
/100
6 views
5 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #327 of 357 articles by views in Chemico-biological interactions
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In order to well maintain the diversity of obtained solutions, a new multiobjective evolutionary algorithm based on decomposition of the objective space for multiobjective optimization problems (MOPs) is designed. In order to achieve the goal, the objective space of a MOP is decomposed into a set of subobjective spaces by a set of direction vectors. In the evolutionary process, each subobjective space has a solution, even if it is not a Pareto optimal solution. In such a way, the diversity of obtained solutions can be maintained, which is critical for solving some MOPs. In addition, if a solution is dominated by other solutions, the solution can generate more new solutions than those solutions, which makes the solution of each subobjective space converge to the optimal solutions as far as possible. Experimental studies have been conducted to compare this proposed algorithm with classic MOEA/D and NSGAII. Simulation results on six multiobjective benchmark functions show that the proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms.
| Reference Key |
dai2014journala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Cai Dai;Yuping Wang |
| Journal | Chemico-biological interactions |
| Year | 2014 |
| DOI |
10.1155/2014/906147
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.