Output details
11 - Computer Science and Informatics
University of Birmingham
Article title
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Type
D - Journal article
Title of journal
IEEE Transactions on Evolutionary Computation
Article number
-
Volume number
14
Issue number
1
First page of article
1
ISSN of journal
1089-778X
Year of publication
2010
URL
-
Number of additional authors
3
Additional information
<22>This was the first paper on the rigorous analysis of computational time complexity of estimation of distribution algorithms (EDAs), which is very different from conventional evolutionary algorithms. A new approach to proving complexity bounds for randomised search heuristics, especially for EDAs, was proposed. The analytical approach and results have enabled us to understand theoretically which algorithmic feature(s) makes a problem hard/easy for an EDA, and given insight into the question of when an EDA is expected to perform better than an EA. The research led to invited keynote speeches on this topic at LION'10 in Italy and WCCI'12 in Brisbane.
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Natural Computation
Citation count
17
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
