.png){kind=icon}
Return
A modified directed search domain algorithm for multiobjective engineering and design optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00158-013-0946-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiobjective optimization is one of the key challenges in engineering design process. Since the answer to such problem is not unique, a set of evenly distributed solutions is particularly important for a designer. The Directed Search Domain (DSD) method is a numerical optimization approach that has proven to be efficient enough to tackle such optimization problems. In this paper, we propose two modifications to the DSD approach which make the solution algorithm simpler for program implementation. These modifications are related to the control of the search domain and reformulation of the appropriate single objective optimization problem. As a result, the computational efficiency of the method is increased due to the lower number of objective function evaluations. The capabilities of the new approach are demonstrated on a set of test cases.
Keywords:
Directed search domain
Multiobjective optimization
Engineering design
Pareto set
Journal
IF:
4
Papers:
4.9K
Citations:
1.7W
Organization
Cited Papers
Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSave
View more