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.
An evolutionary algorithm with species-specific explosion for multimodal optimization
Full text PdfPdf (1.24 MB)
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
SESSION: Track 9: genetic algorithms table of contents
Pages: 923-930  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Ka-Chun Wong  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Kwong-Sak Leung  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Man-Hon Wong  The Chinese University of Hong Kong, Hong Kong, Hong Kong
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): 15,   Downloads (12 Months): 58,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

This paper presents an evolutionary algorithm, which we call Evolutionary Algorithm with Species-specific Explosion (EASE), for multimodal optimization. EASE is built on the Species Conserving Genetic Algorithm (SCGA), and the design is improved in several ways. In particular, it not only identifies species seeds, but also exploits the species seeds to create multiple mutated copies in order to further converge to the respective optimum for each species. Experiments were conducted to compare EASE and SCGA on four benchmark functions. Cross-comparison with recent rival techniques on another five benchmark functions was also reported. The results reveal that EASE has a competitive edge over the other algorithms tested.


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
 
5
 
6
 
7
 
8
K. A. D. Jong. Evolutionary Computation. A Unified Approach. MIT Press, Cambridge, MA, USA, 2006.
 
9
K. S. Leung and Y. Liang. Adaptive elitist-population based genetic algorithm for multimodal function optimization. In In GECCO 2003, LNCS 2723, pages 1160--1171. Springer-Verlag, 2003.
 
10
11
12
 
13
R. Manner, S. W. Mahfoud, and S. W. Mahfoud. Crowding and preselection revisited. In Parallel Problem Solving From Nature, pages 27--36. North-Holland, 1992.,
 
14
 
15
A. Petrowski. A clearing procedure as a niching method for genetic algorithms. In Evolutionary Computation, 1996., Proceedings of IEEE International Conference on, pages 798--803, Nagoya, Japan, May 1996.
16
 
17
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 optimization. Technical report, Nanyang Technological University, 2005.
 
18
R. Thomsen. Multimodal optimization using crowding-based differential evolution. In Evolutionary Computation, 2004. CEC2004. Congress on, volume 2, pages 1382--1389, June 2004.

Collaborative Colleagues:
Ka-Chun Wong: colleagues
Kwong-Sak Leung: colleagues
Man-Hon Wong: colleagues