Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators

Doerr, Benjamin; Hebbinghaus, Nils; Neumann, Frank; Runarsson, Thomas Ph.; Beyer, Hans G.; Burke, Edmund; Merelo-Guervós, Juan J.; Whitley, L. Darrell; Yao, Xin

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators

MPS-Authors

/persons/resource/persons44338

Doerr, Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44598

Hebbinghaus, Nils
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45115

Neumann, Frank
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Doerr, B., Hebbinghaus, N., & Neumann, F. (2006). Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. In Parallel Problem Solving from Nature - PPSN IX, 9th International Conference (pp. 978-987). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-23F9-4

要旨

We investigate the effect of restricting the mutation operator in evolutionary algorithms with respect to the runtime behavior. For the Eulerian cycle problem; we present runtime bounds on evolutionary algorithms with a restricted operator that are much smaller than the best upper bounds for the general case. It turns out that a plateau that both algorithms have to cope with is left faster by the new algorithm. In addition, we present a lower bound for the unrestricted algorithm which shows that the restricted operator speeds up computation by at least a linear factor.