Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)

A Restricted Genetic Algorithm based on Ascending of Tangent Planes

Authors
Jinhua Zheng 0, Yan Peng
Corresponding Author
Jinhua Zheng
0The college of information engineering, Xiangtan University.
Available Online October 2006.
DOI
https://doi.org/10.2991/jcis.2006.186How to use a DOI?
Keywords
restricted genetic algorithm,tangent planes,optimization of multimodal function
Abstract
Classical Genetic Algorithms(CGAs)accomplish the global search by selection,crossover and mutation. It has many shortages. Here we proposed a restricted genetic algorithm based on ascending of tangent plane(RGAATP). Our algorithm is simple and effective, which approaches the global solution step by step. It is proved that the algorithm is global convergent, and it can solve the optimization of multimodal function easily and effectively. The experimental results show that its performance is more stable and efficient than aSGA.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
Part of series
Advances in Intelligent Systems Research
Publication Date
October 2006
ISBN
978-90-78677-01-7
ISSN
1951-6851
DOI
https://doi.org/10.2991/jcis.2006.186How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Jinhua Zheng
AU  - Yan Peng
PY  - 2006/10
DA  - 2006/10
TI  - A Restricted Genetic Algorithm based on Ascending of Tangent Planes
PB  - Atlantis Press
SP  - 549
EP  - 552
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.186
DO  - https://doi.org/10.2991/jcis.2006.186
ID  - Zheng2006/10
ER  -