A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
作者： Dirk Sudholt
DOI:
关键词:
摘要: … Running time analysis has emerged as an important and very active … time until an EA has found a satisfactory solution for a given problem. By assessing how the expected running time …
arxiv.org参考文章(39)
Per Kristian Lehre, Negative drift in populations parallel problem solving from nature. pp. 244- 253 ,(2010) , 10.1007/978-3-642-15844-5_25
Jeffrey Horn, David E. Goldberg, Kalyanmoy Deb, Long Path Problems parallel problem solving from nature. pp. 149- 158 ,(1994) , 10.1007/3-540-58484-6_259
Christine Zarges, Dirk Sudholt, Analysis of an Iterated Local Search Algorithm for Vertex Coloring Algorithms and Computation. pp. 340- 352 ,(2010) , 10.1007/978-3-642-17517-6_31
Benjamin Doerr, Carola Winzen, None, Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity computer science symposium in russia. pp. 15- 28 ,(2011) , 10.1007/978-3-642-20712-9_2
Ingo Wegener, Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions Springer, Boston, MA. pp. 349- 369 ,(2003) , 10.1007/0-306-48041-7_14
Dirk Sudholt, General lower bounds for the running time of evolutionary algorithms parallel problem solving from nature. pp. 124- 133 ,(2010) , 10.1007/978-3-642-15844-5_13
Süntje Böttcher, Benjamin Doerr, Frank Neumann, Optimal fixed and adaptive mutation rates for the leadingones problem parallel problem solving from nature. pp. 1- 10 ,(2010) , 10.1007/978-3-642-15844-5_1
P.A. Borisovsky, A.V. Eremeev, Comparing evolutionary algorithms to the (1+1) -EA Theoretical Computer Science. ,vol. 403, pp. 33- 41 ,(2008) , 10.1016/J.TCS.2008.03.008
Benjamin Doerr, Daniel Johannsen, Carola Winzen, None, Multiplicative drift analysis genetic and evolutionary computation conference. pp. 1449- 1456 ,(2010) , 10.1145/1830483.1830748
Pietro S. Oliveto, Jun He, Xin Yao, Time Complexity of Evolutionary Algorithms for Combinatorial Optimization: A Decade of Results International Journal of Automation and Computing. ,vol. 4, pp. 281- 293 ,(2007) , 10.1007/S11633-007-0281-3