Modifications of real code genetic algorithm for global optimization
A series of modifications to the real coded genetic algorithm for the task of locating the global minimum of multidimensional functions are presented here. These modifications include a new stopping rule, a novel mutation mechanism and a periodically application of a local search procedure. The prop...
Saved in:
| Published in | Applied mathematics and computation Vol. 203; no. 2; pp. 598 - 607 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
Elsevier Inc
15.09.2008
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0096-3003 1873-5649 |
| DOI | 10.1016/j.amc.2008.05.005 |
Cover
| Summary: | A series of modifications to the real coded genetic algorithm for the task of locating the global minimum of multidimensional functions are presented here. These modifications include a new stopping rule, a novel mutation mechanism and a periodically application of a local search procedure. The proposed modifications are tested on a series of optimization problems and the results are reported. |
|---|---|
| ISSN: | 0096-3003 1873-5649 |
| DOI: | 10.1016/j.amc.2008.05.005 |