鲁棒线性优化(1+1)- EA的运行时间分析
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization
摘要:
进化算法(EA)已经发现了许多成功的实际应用,其中的优化问题往往受到广泛的不确定性。为了从理论上理解进化算法的实际行为,有一系列的努力致力于分析不确定性下优化的进化算法的运行时间。现有的研究主要集中在噪声和动态优化,而另一种常见的不确定优化,即,鲁棒优化,很少被触及。在本文中,我们分析了(1+1)-EA解决鲁棒线性优化问题(即,鲁棒场景下的线性问题)具有基数约束$k$。两种常见的稳健方案,即,删除鲁棒性和最坏情况,被认为是。特别是,我们推导出严格的范围内的强大的参数$d$或预算$k$允许(1+1)-EA找到一个最佳的解决方案,在多项式运行时间,这揭示了潜在的EA强大的优化。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。