文件列表:

COPYING (35147, 2012-05-12)
bitflip (0, 2012-05-12)
bitflip\bitflip.hs (1996, 2012-05-12)
bitflip\bitflip.py (1513, 2012-05-12)
constrained (0, 2012-05-12)
constrained\mulambdadeathpenalty.py (4552, 2012-05-12)
rechenberg (0, 2012-05-12)
rechenberg\mlrechenberg.hs (6445, 2012-05-12)
rechenberg\mlrechenberg.py (3982, 2012-05-12)

# ea-sandbox This repository is a public repository for some of my evolutionary-algorithms I implemented. Use it as an alternative example for these algorithms, just in case you want to learn evolutionary algorithms, which is great! The publication of Hans-Georg Beyer and Hans-Paul Schwefel [http://www.cs.bham.ac.uk/~pxt/NIL/es.pdf](https://github.com/jpzk/ea-sandbox/blob/master/PDF-file) is a comprehensive introduction to evolution strategies. In the following descriptions are illustrated. ## Basic information (1+1) means (mu+lambda), which is common in literature. mu is the amount of individuals to select and lambda is the amount of individuals to generate by mutation. There are two types of selection the plus- and comma-selection. The plus-selection considers old population and mutated population when selecting the fittest for the next generation. The comma-selection only takes account of the mutated population. ## License This file is part of evolutionary-algorithms-sandbox. evolutionary-algorithms-sandbox is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. evolutionary-algorithms-sandbox is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with evolutionary-algorithms-sandbox. If not, see .

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：