otimização pode ser representado da seguinte forma: ◦ Dados: uma função f : A → R de algum conjunto A de números reais; ◦ Buscando: um elemento x0 em A tal que f(x0) ≤ f(x) para todo x em A ("minimização") ou tal que f(x0) ≥ f(x) para todo x em A ("maximização").
extensible evolutionary algorithms framework, with complete documentation, Apache License 2.0; • deap: Distributed Evolutionary Algorithms in Python, GNU Lesser GPL; • pySTEP: Python Strongly Typed gEnetic Programming, MIT License; • Pyevolve: Pyevolve was developed to be a complete genetic algorithm framework written in pure python;
GP) Modules, Open Source; • PonyGEa: small, one source file implementation of GE, with an interactive graphics demo application GNU GPL v3; • inspyred: Biologically inspired computation encompasses a broad range of algorithms including evolutionary computation, swarm intelligence, and neural networks, GNU GPL v3; • DRP: Directed Ruby Programming, Genetic Programming & Grammatical Evolution Library, GNU GPL;