Theoretical Analysis of Stochastic Search Algorithms

作者: Per Kristian Lehre , Pietro S. Oliveto

DOI:

关键词:

摘要: Theoretical analyses of stochastic search algorithms, albeit few, have always existed since these algorithms became popular. Starting in the nineties a systematic approach to analyse the performance of stochastic search heuristics has been put in place. This quickly increasing basis of results allows, nowadays, the analysis of sophisticated algorithms such as population-based evolutionary algorithms, ant colony optimisation and artificial immune systems. Results are available concerning problems from various domains including …

参考文章(29)
Thomas Jansen, Methods for the Analysis of Evolutionary Algorithms Springer Berlin Heidelberg. pp. 85- 155 ,(2013) , 10.1007/978-3-642-17339-4_5
Per Kristian Lehre, Negative drift in populations parallel problem solving from nature. pp. 244- 253 ,(2010) , 10.1007/978-3-642-15844-5_25
Thomas Jansen, Christine Zarges, Computing Longest Common Subsequences with the B-Cell Algorithm Lecture Notes in Computer Science. pp. 111- 124 ,(2012) , 10.1007/978-3-642-33757-4_9
Daniel Johannsen, Random combinatorial structures and randomized search heuristics Universität des Saarlandes Saarbrücken. ,(2010) , 10.22028/D291-26016
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
Thomas Jansen, Pietro S. Oliveto, Christine Zarges, On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem international conference on artificial immune systems. pp. 117- 131 ,(2011) , 10.1007/978-3-642-22371-6_13
Tiago Paixão, Golnaz Badkobeh, Nick Barton, Doğan Çörüş, Duc-Cuong Dang, Tobias Friedrich, Per Kristian Lehre, Dirk Sudholt, Andrew M Sutton, Barbora Trubenová, None, Toward a unifying framework for evolutionary processes Journal of Theoretical Biology. ,vol. 383, pp. 28- 43 ,(2015) , 10.1016/J.JTBI.2015.07.011
Benjamin Doerr, Carola Winzen, Reducing the arity in unbiased black-box complexity Theoretical Computer Science. ,vol. 545, pp. 108- 121 ,(2014) , 10.1016/J.TCS.2013.05.004