.png){kind=icon}
Return
Directed searching optimization algorithm for constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.01.079.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A directed searching optimization algorithm (DSO) is proposed to solve constrained optimization problems in this paper. The proposed algorithm includes two important operations position updating and genetic mutation. Position updating enables the non-best solution vectors to mimic the best one, which is beneficial to the convergence of the DSO; genetic mutation can increase the diversity of individuals, which is beneficial to preventing the premature convergence of the DSO. In addition, we adopt the penalty function method to balance objective and constraint violations. We can obtain satisfactory solutions for constrained optimization problems by combining the DSO and the penalty function method. Experimental results indicate that the proposed algorithm can be an efficient alternative on solving constrained optimization problems. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Directed searching optimization algorithm
Constrained optimization problems
Position updating
Genetic mutation
Penalty function method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
View more organizations
Cited Papers
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
ShareSaveLeisure time physical activity and dementia risk: a dose-response meta-analysis of prospective studies.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAIShareSave
View more