Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion docs/source/algorithms/soo/de.md
Original file line number Diff line number Diff line change
Expand Up @@ -50,6 +50,8 @@ where $\pi$ is a random permutation with 3 entries. The difference is taken betw

Then, a second crossover between an individual and the so-called donor vector $v$ is performed. The second crossover can be simply binomial/uniform or exponential.

In addition, pymoo's `DE` applies a polynomial mutation (`eta=20`, at least one variable) to each trial vector with probability `prob_mut` (default `0.1`). Pass `prob_mut=0.0` for the classical DE without it.



A great tutorial and more detailed information can be found [here](https://web.archive.org/web/20190928024126/http://www1.icsi.berkeley.edu/~storn/code.html). The following guideline is copied from the description there (variable names are modified):
Expand Down Expand Up @@ -80,7 +82,6 @@ algorithm = DE(
sampling=LHS(),
variant="DE/rand/1/bin",
CR=0.3,
dither="vector",
jitter=False
)

Expand Down
1 change: 0 additions & 1 deletion examples/algorithms/soo/nonconvex/de.py
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,6 @@
pop_size=100,
variant="DE/rand/1/bin",
CR=0.3,
dither="vector",
jitter=True
)

Expand Down