2. Programming and using an evolutionary algorithm
2.1 Structure and ingredients
The basic ingredients of a "canonical" evolutionary algorithm can be described simply; however, what is presented below should be understood as a "cooking recipe." Effective applications based on evolutionary algorithms are often more complex, the key issue being to adapt, or even create, your own operators to match the specificities of the problem.
The basis of a classic evolutionary algorithm is a generational loop of populations of individuals, each corresponding to a solution to the problem in question
The Ultimate Scientific and Technical Reference
This article is included in
Eco-design and sustainable innovation
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Programming and using an evolutionary algorithm
Theoretical overview: why and how does it work?
Bibliography
Software tools
Inspyred, a library of bio-inspired algorithms in Python
https://pythonhosted.org/inspyred/
GAlib - C++ Genetic Algorithms Library
https://sourceforge.net/projects/galib/
Matlab Global Optimization...
Websites
Artificial Evolution Association
It brings together French researchers in this field and organizes international conferences (EA), workshops, and schools.
SIGEVO, Special Interest Group on Genetic and Evolutionary Computation
Events
ACM Genetic and Evolutionary Computation Conference (GECCO)
https://dl.acm.org/conference/gecco
IEEE Congress on Evolutionary Computation (CEC)
https://en.wikipedia.org/wiki/IEEE_Congress_on_Evolutionary_Computation
...
The Ultimate Scientific and Technical Reference
