From black-box complexity to designing new genetic algorithms

Black-box complexity theory recently produced several surprisingly fast black-box optimization algorithms. In this work, we exhibit one possible reason: These black-box algorithms often profit from solutions inferior to the previous-best. In contrast, evolutionary approaches guided by the “survival...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 567; pp. 87 - 104
Main Authors:	Doerr, Benjamin, Doerr, Carola, Ebel, Franziska
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.02.2015 Elsevier
Subjects:	Algorithms Asymptotic properties Black-box complexity Computer Science Crossovers Evolutionary Genetic algorithms Heuristic search Mathematical analysis Mathematical models Mutations Neural and Evolutionary Computing Run time (computers) Runtime analysis Theory of randomized search heuristics Heuristic search Theory of randomized search heuristics Runtime analysis Genetic algorithms Black-box complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!