ACM Home Page
Please provide us with feedback. Feedback
Geometric differential evolution
Full text PdfPdf (523 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
SESSION: Track 15: theory table of contents
Pages 1705-1712  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Alberto Moraglio  university of coimbra, coimbra, Portugal
Julian Togelius  Dalle Molle Institute for Artificial Intelligence, Manno-Lugano, Switzerland
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): 13,   Downloads (12 Months): 49,   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.1570130
What is a DOI?

ABSTRACT

Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continuous and combinatorial spaces. Differential Evolution (DE) is similar to PSO but it uses different equations governing the motion of the particles. This paper generalizes the DE algorithm to combinatorial search spaces extending its geometric interpretation to these spaces, analogously as what was done for the traditional PSO algorithm. Using this formal algorithm, Geometric Differential Evolution (GDE), we formally derive the specific GDE for the Hamming space associated with binary strings and present experimental results on a standard benchmark of problems.


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
T. Gong and A.L. Tuson. Differential evolution for binary encoding. In Soft Computing in Industrial Applications, pages 251--262. Springer, 2007.
 
2
S. Kauffman. Origins of order: self-organization and selection in evolution. Oxford University Press, 1993.
 
3
J. Kennedy and R.C. Eberhart. A discrete binary version of the particle swarm algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 5:4104--4108, 1997.
 
4
 
5
E.F. Krause. Taxicab Geometry: An Adventure in Non-Euclidean Geometry. Courier Dover Publications, 1986.
 
6
A. Moraglio. Towards a geometric unification of evolutionary algorithms. PhD thesis, University of Essex, 2007.
7
 
8
9
 
10
 
11
G. Pampara, A. Engelbrecht, and N. Franken. Binary differential evolution. In IEEE Congress on Evolutionary Computation, 2006.
 
12
 
13
 
14
J. Togelius, R.D. Nardi, and A. Moraglio. Geometric pso + gp = particle swarm programming. In Proceedings of the Congress on Evolutionary Comptutation (CEC), 2008.

Collaborative Colleagues:
Alberto Moraglio: colleagues
Julian Togelius: colleagues