Running time analysis of the (1+1)-EA for robust linear optimization

• Published in: Theoretical computer science Vol. 843; pp. 57 - 72
• Main Authors: Bian, Chao, Qian, Chao, Tang, Ke, Yu, Yang
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 02.12.2020
• Subjects: Computational complexity; Evolutionary algorithms; Robust optimization; Running time analysis; Robust optimization; Evolutionary algorithms; Computational complexity; Running time analysis
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2020.07.001

Evolutionary algorithms (EAs) have found many successful real-world applications, where the optimization problems are often subject to a wide range of uncertainties. To understand the practical behaviors of EAs theoretically, there are a series of efforts devoted to analyzing the running time of EAs...