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

Bian，Chao1; Qian，Chao1; Tang，Ke2; Yu，Yang1

2020-12-02

10.1016/j.tcs.2020.07.001

THEORETICAL COMPUTER SCIENCE   影响因子和分区

0304-3975

1879-2294

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 for optimization under uncertainties. Existing studies mainly focus on noisy and dynamic optimization, while another common type of uncertain optimization, i.e., robust optimization, has been rarely touched. In this paper, we analyze the expected running time of the (1+1)-EA solving robust linear optimization problems (i.e., linear problems under robust scenarios) with a cardinality constraint k. Two common robust scenarios, i.e., deletion-robust and worst-case, are considered. Particularly, we derive tight ranges of the robust parameter d or budget k allowing the (1+1)-EA to find an optimal solution in polynomial running time, which disclose the potential of EAs for robust optimization.

Computational complexity Evolutionary algorithms Robust optimization Running time analysis

SCI ; EI

英语

其他

National Science Foundation of China[61876077][61672478] ; Fundamental Research Funds for the Central Universities[14380004]

Computer Science

Computer Science, Theory & Methods

WOS:000577368200005

ELSEVIER

20203108995796

Evolutionary algorithms ; Linear programming ; Uncertainty analysis ; Polynomials ; Budget control

Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1 ; Algebra:921.1 ; Probability Theory:922.1

COMPUTER SCIENCE

2-s2.0-85088632954

Scopus

1.State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing,210023,China
2.Shenzhen Key Laboratory of Computational Intelligence,Department of Computer Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China

Bian，Chao,Qian，Chao,Tang，Ke,et al. Running time analysis of the (1+1)-EA for robust linear optimization[J]. THEORETICAL COMPUTER SCIENCE,2020,843:57-72.

Bian，Chao,Qian，Chao,Tang，Ke,&Yu，Yang.(2020).Running time analysis of the (1+1)-EA for robust linear optimization.THEORETICAL COMPUTER SCIENCE,843,57-72.

Bian，Chao,et al."Running time analysis of the (1+1)-EA for robust linear optimization".THEORETICAL COMPUTER SCIENCE 843(2020):57-72.