.png){kind=icon}
Return
Real-coded genetic algorithm with uniform random local search
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.11.097.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Genetic algorithms are efficient global optimizers, but they are weak in performing fine-grained local searches. In this paper, the local search capability of genetic algorithm is improved by hybridizing real coded genetic algorithm with 'uniform random' local search to form a hybrid real coded genetic algorithm termed 'RCGAu'. The incorporated local technique is applied to all newly created offspring so that each offspring solution is given the opportunity to effectively search its local neighborhood for the best local optimum. Numerical experiments show that the performance of RCGA is remarkably improved by the uniform random local search technique. (C) 2013 Elsevier Inc. All rights reserved.
Keywords:
Global optimization
Real coded genetic algorithms
Uniform random local search
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave no more