.png){kind=icon}
Return
The development of a changing range genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2005.05.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Genetic algorithms are nature-inspired heuristics for search and optimization. The key to success lies in focusing the search space on a feasible region where a global optimum is located. This study investigates an approach that adaptively shifts and shrinks the size of the search space of the feasible region by employing feasible and infeasible solutions in the population to reach the global optimum. Several test cases demonstrate the ability of this approach to improve significantly the speed of convergence to the global optimum with reasonable precision. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
nonlinear programming
genetic algorithms
optimization methods
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.3
Papers:
1.3W
Citations:
5.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveMortality and Growth of Low Birth Weight Infants on the Kangaroo Mother Program in Bogota, Colombia.png)
Pediatrics
PediatricsIF0
PREAI
ShareSave no more
no more