On the choice of the mutation probability for the (1+1) EA (2000)
Cached
Download Links
| Venue: | PROC. OF PPSN VI (PARALLEL PROBLEM SOLVING FROM NATURE), LNCS |
| Citations: | 13 - 8 self |
BibTeX
@INPROCEEDINGS{Jansen00onthe,
author = {Thomas Jansen and Ingo Wegener},
title = {On the choice of the mutation probability for the (1+1) EA},
booktitle = {PROC. OF PPSN VI (PARALLEL PROBLEM SOLVING FROM NATURE), LNCS},
year = {2000},
pages = {89--98},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
When evolutionary algorithms are used for function optimization, they perform a heuristic search that is influenced by many parameters. Here, the choice of the mutation probability is investigated. It is shown for a non-trivial example function that the most recommended choice for the mutation probability 1/n is by far not optimal, i. e., it leads to a superpolynomial running time while another choice of the mutation probability leads to a search algorithm with expected polynomial running time. Furthermore, a simple evolutionary algorithm with an extremely simple dynamic mutation probability scheme is suggested to overcome the difficulty of finding a proper setting for the mutation probability.
