ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Adaptive evolution: an efficient heuristic for global optimization
Full text PdfPdf (627 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 6: evolution strategies and evolutionary programming table of contents
Pages: 1827-1828  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Francisco Viveros Jiménez  UNISTMO, Ixtepec, Oaxaca, Mexico
Efrén Mezura Montes  LANIA, Xalapa, Veracruz, Mexico
Alexander Gelbukh  Instituto Politecnico Nacional, Mexico, DF, Mexico
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570184
What is a DOI?

ABSTRACT

This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because it uses small populations (less than 10 individuals). The two main mechanisms of AEv are elitism and adaptive behavior. It has an adaptive parameter to adjust the balance between global exploration, local exploitation and elitism. Its two crossover operators allow a newly-generated offspring to be parent of other offspring in the same generation. AEv requires the fine-tuning of two parameters (several state-of-the-art approaches use at least three). AEv is tested on a set of 10 benchmark functions with 30 decision variables and it is compared with respect to some state-of-the-art algorithms to show its competitive performance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger, and S. Tiwari. Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Obtimization. Nanyang Technol. Univ., Singaporem IIT Kanpur, KanGal Rep. 2005005, India, 2005.
 
5
J. F. Viveros. Dse: A hybrid evolutionary algorithm with mathematical search method. Research in Computing Science, 34, 59--67, 2008.
 
6
K. Krishnakumar. Micro-genetic algorithms for stationary and non-stationary function optimization. SPIE: Intelligent control and adaptive systems, 1(1):289--296, 1989.
 
7
J. C. Fuentes-Cabrera and C. C. Coello. Handling Constraints in PSO using a Small Population Size. MICAI 2007: Advances in Artificial Intelligence, 4827: 41--51, 2007.

Collaborative Colleagues:
Francisco Viveros Jiménez: colleagues
Efrén Mezura Montes: colleagues
Alexander Gelbukh: colleagues