Referenced Items are not available for this document.
Based on the combination of the general evolutionary programming and the random search technique, this paper develops a self-adaptive mutation operator and presents a new algorithm, called the self-adaptive evolutionary programming. The algorithm includes two important aspects: 1) a new modal of mutation which reflects the principle of organic evolution in nature; and 2) the mutation operator is self-adaptive during the optimization. The new method is tested on some mathematical functions, and numerical results demonstrate the strong self-adaptability and versatility of the new algorithm
Published in:
Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on
(Volume:5
)
Date of Conference: 2000
- Page(s):
- 3481 - 3485 vol.5
- Meeting Date :
- 28 Jun 2000-02 Jul 2000
- Print ISBN:
- 0-7803-5995-X
- INSPEC Accession Number:
- 6754815
- Conference Location :
- Hefei
- Digital Object Identifier :
- 10.1109/WCICA.2000.863188
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
