Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation 2012
DOI: 10.1145/2330784.2330799
|View full text |Cite
|
Sign up to set email alerts
|

Deap

Abstract: DEAP (Distributed Evolutionary Algorithms in Python) is a novel evolutionary computation framework for rapid prototyping and testing of ideas. Its design departs from most other existing frameworks in that it seeks to make algorithms explicit and data structures transparent, as opposed to the more common black box type of frameworks. It also incorporates easy parallelism where users need not concern themselves with gory implementation details like synchronization and load balancing, only functional decompositi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 133 publications
(34 citation statements)
references
References 9 publications
0
33
0
1
Order By: Relevance
“…The deformation from the FEM simulation is used to evaluate the generated magnetization distribution through a fitness function (see Supporting Information for more details). Selection, crossover, and mutation steps of the EA are conducted by using an open‐source evolutionary computation framework to create new magnetization distributions until the desired deformation with a small enough fitness function value or the predetermined maximum number of generations is reached . The detailed algorithm information regarding the algorithm is shown in Supporting Information.…”
Section: Resultsmentioning
confidence: 99%
“…The deformation from the FEM simulation is used to evaluate the generated magnetization distribution through a fitness function (see Supporting Information for more details). Selection, crossover, and mutation steps of the EA are conducted by using an open‐source evolutionary computation framework to create new magnetization distributions until the desired deformation with a small enough fitness function value or the predetermined maximum number of generations is reached . The detailed algorithm information regarding the algorithm is shown in Supporting Information.…”
Section: Resultsmentioning
confidence: 99%
“…1 . The Non-dominated Sorted Genetic Algorithm ( nsga-ii ) [ 79 ] from the Distributed Evolutionary Algorithms in Python ( deap ) [ 80 ] package was used in combination with the COBRApy package [ 78 ] for FBA evaluation. Equal weight was placed on reducing the number of reactions used in the model, whilst maximizing the biomass output.…”
Section: Methodsmentioning
confidence: 99%
“…The search over candidate model structures and parameterizations employs a customized genetic programming algorithm, an evolutionary approach that encodes mathematical expressions in a tree structure to support symbolic regression. Modular components of the algorithm were drawn from the package Distributed Evolutionary Algorithms in Python, or DEAP (De Rainville et al, 2012). As depicted in the Model Generation panel of Figure 2, mutation and crossover operators act on ordered representations of models, where each tree is flattened into an ordered list of elements, to generate new structures from promising candidates and explore the model space during optimization.…”
Section: Search Algorithmmentioning
confidence: 99%