A gentle introduction to theory (for non-theoreticians)
Pages 369 - 398
References
[1]
[ABD20a] Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. Fast mutation in crossover-based algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1268--1276. ACM, 2020.
[2]
[ABD20b] Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. First steps towards a runtime analysis when starting with a good solution. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 560--573. Springer, 2020.
[3]
[ABD21] Denis Antipov, Maxim Buzdalov, and Benjamin Doerr. Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In Genetic and Evolutionary Computation Conference, GECCO 2021. ACM, 2021. To appear.
[4]
[AD11] Anne Auger and Benjamin Doerr, editors. Theory of Randomized Search Heuristics. World Scientific Publishing, 2011.
[5]
[AD20] Denis Antipov and Benjamin Doerr. Runtime analysis of a heavy-tailed (1 + (λ, λ)) genetic algorithm on jump functions. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 545--559. Springer, 2020.
[6]
[ADFH18] Denis Antipov, Benjamin Doerr, Jiefeng Fang, and Tangi Hetet. Runtime analysis for the (μ + λ) EA optimizing OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 1459--1466. ACM, 2018.
[7]
[ADK19] Denis Antipov, Benjamin Doerr, and Vitalii Karavaev. A tight runtime analysis for the (1 + (λ, λ)) GA on LeadingOnes. In Foundations of Genetic Algorithms, FOGA 2019, pages 169--182. ACM, 2019.
[8]
[ADK20] Denis Antipov, Benjamin Doerr, and Vitalii Karavaev. The (1 + (λ, λ)) GA is even faster on multimodal problems. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1259--1267. ACM, 2020.
[9]
[ADY19] Denis Antipov, Benjamin Doerr, and Quentin Yang. The efficiency threshold for the offspring population size of the (μ, λ) EA. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 1461--1469. ACM, 2019.
[10]
[AL14] Fawaz Alanazi and Per Kristian Lehre. Runtime analysis of selection hyper-heuristics with classical learning mechanisms. In Congress on Evolutionary Computation, CEC 2104, pages 2515--2523. IEEE, 2014.
[11]
[AMT15] Youhei Akimoto, Sandra Astete Morales, and Olivier Teytaud. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theoretical Computer Science, 605:42--50, 2015.
[12]
[Bäc93] Thomas Bäck. Optimal mutation rates in genetic search. In International Conference on Genetic Algorithms, ICGA 1993, pages 2--8. Morgan Kaufmann, 1993.
[13]
[Bäc96] Thomas Bäck. Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, 1996.
[14]
[BB19] Anton Bassin and Maxim Buzdalov. The 1/5-th rule with rollbacks: on self-adjustment of the population size in the (1 + (λ, λ)) GA. In Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pages 277--278. ACM, 2019.
[15]
[BB20] Anton Bassin and Maxim Buzdalov. The (1 + (λ, λ)) genetic algorithm for permutations. In Genetic and Evolutionary Computation Conference, GECCO 2020, Companion Volume, pages 1669--1677. ACM, 2020.
[16]
[BBD+09] Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, and Frank Neumann. Computing single source shortest paths using single-objective fitness. In Foundations of Genetic Algorithms, FOGA 2009, pages 59--66. ACM, 2009.
[17]
[BBD21a] Henry Bambury, Antoine Bultel, and Benjamin Doerr. Generalized jump functions. In Genetic and Evolutionary Computation Conference, GECCO 2021. ACM, 2021. To appear.
[18]
[BBD21b] Riade Benbaki, Ziyad Benomar, and Benjamin Doerr. A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima. In Genetic and Evolutionary Computation Conference, GECCO 2021. ACM, 2021. To appear.
[19]
[BD17] Maxim Buzdalov and Benjamin Doerr. Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. In Genetic and Evolutionary Computation Conference, GECCO 2017, pages 1343--1350. ACM, 2017.
[20]
[BDDV20] Maxim Buzdalov, Benjamin Doerr, Carola Doerr, and Dmitry Vinokurov. Fixed-target runtime analysis. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1295--1303. ACM, 2020.
[21]
[BDN10] Süntje Böttcher, Benjamin Doerr, and Frank Neumann. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In Parallel Problem Solving from Nature, PPSN 2010, pages 1--10. Springer, 2010.
[22]
[BFM97] Thomas Bäck, David B. Fogel, and Zbigniew Michalewicz. Handbook of Evolutionary Computation. IOP Publishing Ltd., 1997.
[23]
[BLS14] Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. Unbiased black-box complexity of parallel search. In Parallel Problem Solving from Nature, PPSN 2014, pages 892--901. Springer, 2014.
[24]
[BS19] Jakob Bossek and Dirk Sudholt. Time complexity analysis of RLS and (1+1) EA for the edge coloring problem. In Foundations of Genetic Algorithms, FOGA 2019, pages 102--115. ACM, 2019.
[25]
[CDEL18] Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, and Per Kristian Lehre. Level-based analysis of genetic algorithms and other search processes. IEEE Transactions on Evolutionary Computation, 22:707--719, 2018.
[26]
[CL20] Brendan Case and Per Kristian Lehre. Self-adaptation in nonelitist evolutionary algorithms on discrete problems with unknown structure. IEEE Transactions on Evolutionary Computation, 24:650--663, 2020.
[27]
[CLNP16] Dogan Corus, Per Kristian Lehre, Frank Neumann, and Mojgan Pourhassan. A parameterised complexity analysis of bi-level optimisation with evolutionary algorithms. Evolutionary Computation, 24:183--203, 2016.
[28]
[CO18] Dogan Corus and Pietro S. Oliveto. Standard steady state genetic algorithms can hillclimb faster than mutation-only evolutionary algorithms. IEEE Transactions on Evolutionary Compututation, 22:720--732, 2018.
[29]
[CO20] Dogan Corus and Pietro S. Oliveto. On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica, 82:3676--3706, 2020.
[30]
[CS18] Edgar Covantes Osuna and Dirk Sudholt. Runtime analysis of probabilistic crowding and restricted tournament selection for bimodal optimisation. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 929--936. ACM, 2018.
[31]
[DD15a] Benjamin Doerr and Carola Doerr. Optimal parameter choices through self-adjustment: Applying the 1/5-th rule in discrete settings. In Genetic and Evolutionary Computation Conference, GECCO 2015, pages 1335--1342. ACM, 2015.
[32]
[DD15b] Benjamin Doerr and Carola Doerr. A tight runtime analysis of the (1+(λ, λ)) genetic algorithm on OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2015, pages 1423--1430. ACM, 2015.
[33]
[DD18] Benjamin Doerr and Carola Doerr. Optimal static and self-adjusting parameter choices for the (1 + (λ, λ)) genetic algorithm. Algorithmica, 80:1658--1709, 2018.
[34]
[DD20] Benjamin Doerr and Carola Doerr. Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In Benjamin Doerr and Frank Neumann, editors, Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pages 271--321. Springer, 2020. Also available at https://arxiv.org/abs/1804.05650.
[35]
[DDE13] Benjamin Doerr, Carola Doerr, and Franziska Ebel. Lessons from the black-box: Fast crossover-based genetic algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2013, pages 781--788. ACM, 2013.
[36]
[DDE15] Benjamin Doerr, Carola Doerr, and Franziska Ebel. From black-box complexity to designing new genetic algorithms. Theoretical Computer Science, 567:87--104, 2015.
[37]
[DDK14a] Benjamin Doerr, Carola Doerr, and Timo Kötzing. Unbiased black-box complexities of jump functions: how to cross large plateaus. In Genetic and Evolutionary Computation Conference, GECCO 2014, pages 769--776. ACM, 2014.
[38]
[DDK14b] Benjamin Doerr, Carola Doerr, and Timo Kötzing. The unbiased black-box complexity of partition is polynomial. Artificial Intelligence, 216:275--286, 2014.
[39]
[DDK17] Benjamin Doerr, Carola Doerr, and Timo Kötzing. Unknown solution length problems with no asymptotically optimal run time. In Genetic and Evolutionary Computation Conference, GECCO 2017, pages 921--928. ACM, 2017.
[40]
[DDK18] Benjamin Doerr, Carola Doerr, and Timo Kötzing. Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica, 80:1732--1768, 2018.
[41]
[DDL19] Benjamin Doerr, Carola Doerr, and Johannes Lengler. Self-adjusting mutation rates with provably optimal success rules. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 1479--1487. ACM, 2019.
[42]
[DDN19] Benjamin Doerr, Carola Doerr, and Frank Neumann. Fast re-optimization via structural diversity. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 233--241. ACM, 2019.
[43]
[DDST16] Benjamin Doerr, Carola Doerr, Reto Spöhel, and Henning Thomas. Playing Mastermind with many colors. Journal of the ACM, 63:42:1--42:23, 2016.
[44]
[DDY16] Benjamin Doerr, Carola Doerr, and Jing Yang. k-bit mutation with self-adjusting k outperforms standard bit mutation. In Parallel Problem Solving from Nature, PPSN 2016, pages 824--834. Springer, 2016.
[45]
[DDY20] Benjamin Doerr, Carola Doerr, and Jing Yang. Optimal parameter choices via precise black-box analysis. Theoretical Computer Science, 801:1--34, 2020.
[46]
[DFK+16] Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. Escaping local optima with diversity mechanisms and crossover. In Genetic and Evolutionary Computation Conference, GECCO 2016, pages 645--652. ACM, 2016.
[47]
[DFK+18] Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, and Andrew M. Sutton. Escaping local optima using crossover with emergent diversity. IEEE Transactions on Evolutionary Computation, 22:484--497, 2018.
[48]
[DGWY19] Benjamin Doerr, Christian Gießen, Carsten Witt, and Jing Yang. The (1 + λ) evolutionary algorithm with self-adjusting mutation rate. Algorithmica, 81:593--631, 2019.
[49]
[DHK07] Benjamin Doerr, Edda Happ, and Christian Klein. A tight bound for the (1 + 1)-EA for the single source shortest path problem. In Congress on Evolutionary Computation, CEC 2007, pages 1890--1895. IEEE, 2007.
[50]
[DHK12a] Benjamin Doerr, Edda Happ, and Christian Klein. Crossover can provably be useful in evolutionary computation. Theoretical Computer Science, 425:17--33, 2012.
[51]
[DHK12b] Benjamin Doerr, Ashish Ranjan Hota, and Timo Kötzing. Ants easily solve stochastic shortest path problems. In Genetic and Evolutionary Computation Conference, GECCO 2012, pages 17--24. ACM, 2012.
[52]
[DHN07] Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann. Speeding up evolutionary algorithms through asymmetric mutation operators. Evolutionary Computation, 15:401--410, 2007.
[53]
[DJ07] Benjamin Doerr and Daniel Johannsen. Adjacency list matchings: an ideal genotype for cycle covers. In Genetic and Evolutionary Computation Conference, GECCO 2007, pages 1203--1210. ACM, 2007.
[54]
[DJ10] Benjamin Doerr and Daniel Johannsen. Edge-based representation beats vertex-based representation in shortest path problems. In Genetic and Evolutionary Computation Conference, GECCO 2010, pages 759--766. ACM, 2010.
[55]
[DJK+11] Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, and Carola Winzen. Faster black-box algorithms through higher arity operators. In Foundations of Genetic Algorithms, FOGA 2011, pages 163--172. ACM, 2011.
[56]
[DJK+13] Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, and Madeleine Theile. More effective crossover operators for the all-pairs shortest path problem. Theoretical Computer Science, 471:12--26, 2013.
[57]
[DJL17] Duc-Cuong Dang, Thomas Jansen, and Per Kristian Lehre. Populations can be essential in tracking dynamic optima. Algorithmica, 78:660--680, 2017.
[58]
[DJS+13] Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, and Christine Zarges. Mutation rate matters even when optimizing monotone functions. Evolutionary Computation, 21:1--21, 2013.
[59]
[DJW98a] Stefan Droste, Thomas Jansen, and Ingo Wegener. On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. In Parallel Problem Solving from Nature, PPSN 1998, pages 13--22. Springer, 1998.
[60]
[DJW98b] Stefan Droste, Thomas Jansen, and Ingo Wegener. A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs. In International Conference on Evolutionary Computation, ICEC 1998, pages 499--504. IEEE, 1998.
[61]
[DJW02] Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51--81, 2002.
[62]
[DJW10] Benjamin Doerr, Daniel Johannsen, and Carola Winzen. Multiplicative drift analysis. In Genetic and Evolutionary Computation Conference, GECCO 2010, pages 1449--1456. ACM, 2010.
[63]
[DJW12] Benjamin Doerr, Daniel Johannsen, and Carola Winzen. Multiplicative drift analysis. Algorithmica, 64:673--697, 2012.
[64]
[DJWZ13] Benjamin Doerr, Thomas Jansen, Carsten Witt, and Christine Zarges. A method to derive fixed budget results from expected optimisation times. In Genetic and Evolutionary Computation Conference, GECCO 2013, pages 1581--1588. ACM, 2013.
[65]
[DK15] Benjamin Doerr and Marvin Kunnemann. Optimizing linear functions with the (1 + λ) evolutionary algorithm---different asymptotic runtimes for different instances. Theoretical Computer Science, 561:3--23, 2015.
[66]
[DK19] Benjamin Doerr and Timo Kötzing. Multiplicative up-drift. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 1470--1478. ACM, 2019.
[67]
[DK20a] Benjamin Doerr and Martin S. Krejca. Bivariate estimation-of-distribution algorithms can find an exponential number of optima. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 796--804. ACM, 2020.
[68]
[DK20b] Benjamin Doerr and Martin S. Krejca. Significance-based estimation-of-distribution algorithms. IEEE Transactions on Evolutionary Computation, 24:1025--1034, 2020.
[69]
[DK20c] Benjamin Doerr and Martin S. Krejca. The univariate marginal distribution algorithm copes well with deception and epistasis. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, pages 51--66. Springer, 2020.
[70]
[DK21a] Benjamin Doerr and Timo Kötzing. Lower bounds from fitness levels made easy. In Genetic and Evolutionary Computation Conference, GECCO 2021. ACM, 2021. To appear.
[71]
[DK21b] Benjamin Doerr and Martin S. Krejca. A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes. Theoretical Computer Science, 851:121--128, 2021.
[72]
[DKS07] Benjamin Doerr, Christian Klein, and Tobias Storch. Faster evolutionary algorithms by superior graph representation. In Foundations of Computational Intelligence, FOCI 2007, pages 245--250. IEEE, 2007.
[73]
[DL15] Duc-Cuong Dang and Per Kristian Lehre. Simplified runtime analysis of estimation of distribution algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2015, pages 513--518. ACM, 2015.
[74]
[DL16a] Duc-Cuong Dang and Per Kristian Lehre. Runtime analysis of non-elitist populations: from classical optimisation to partial information. Algorithmica, 75:428--461, 2016.
[75]
[DL16b] Duc-Cuong Dang and Per Kristian Lehre. Self-adaptation of mutation rates in non-elitist populations. In Parallel Problem Solving from Nature, PPSN 2016, pages 803--813. Springer, 2016.
[76]
[DLMN17] Benjamin Doerr, Huu Phuoc Le, Régis Makhmara, and Ta Duy Nguyen. Fast genetic algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2017, pages 777--784. ACM, 2017.
[77]
[DLN19] Duc-Cuong Dang, Per Kristian Lehre, and Phan Trung Hai Nguyen. Level-based analysis of the univariate marginal distribution algorithm. Algorithmica, 81:668--702, 2019.
[78]
[DLOW18] Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, and John Alasdair Warwicker. On the runtime analysis of selection hyper-heuristics with adaptive learning periods. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 1015--1022. ACM, 2018.
[79]
[DN20] Benjamin Doerr and Frank Neumann, editors. Theory of Evolutionary Computation---Recent Developments in Discrete Optimization. Springer, 2020. Also available at https://cs.adelaide.edu.au/~frank/papers/TheoryBook2019-selfarchived.pdf.
[80]
[DNDD+18] Rapha!ël Dang-Nhu, Thibault Dardinier, Benjamin Doerr, Gautier Izacard, and Dorian Nogneng. A new analysis method for evolutionary optimization of dynamic and noisy objective functions. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 1467--1474. ACM, 2018.
[81]
[Doe16] Benjamin Doerr. Optimal parameter settings for the (1 + (λ, λ)) genetic algorithm. In Genetic and Evolutionary Computation Conference, GECCO 2016, pages 1107--1114. ACM, 2016.
[82]
[Doe19a] Benjamin Doerr. An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. In Foundations of Genetic Algorithms, FOGA 2019, pages 25--33. ACM, 2019.
[83]
[Doe19b] Benjamin Doerr. A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 1488--1496. ACM, 2019.
[84]
[Doe20a] Benjamin Doerr. Does comma selection help to cope with local optima? In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1304--1313. ACM, 2020.
[85]
[Doe20b] Benjamin Doerr. Lower bounds for non-elitist evolutionary algorithms via negative multiplicative drift. In Parallel Problem Solving From Nature, PPSN 2020, Part II, pages 604--618. Springer, 2020.
[86]
[Doe21] Benjamin Doerr. Exponential upper bounds for the runtime of randomized search heuristics. Theoretical Computer Science, 851:24--38, 2021.
[87]
[dPdLDD15] Axel de Perthuis de Laillevault, Benjamin Doerr, and Carola Doerr. Money for nothing: speeding up evolutionary algorithms through better initialization. In Genetic and Evolutionary Computation Conference, GECCO 2015, pages 815--822. ACM, 2015.
[88]
[Dro02] Stefan Droste. Analysis of the (1+1) EA for a dynamically changing OneMax-variant. In Congress on Evolutionary Computation, CEC 2002, pages 55--60. IEEE, 2002.
[89]
[Dro03] Stefan Droste. Analysis of the (1+1) EA for a dynamically bitwise changing OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2003, pages 909--921. Springer, 2003.
[90]
[Dro04] Stefan Droste. Analysis of the (1+1) EA for a noisy OneMax. In Genetic and Evolutionary Computation Conference, GECCO 2004, pages 1088--1099. Springer, 2004.
[91]
[Dro06] Stefan Droste. A rigorous analysis of the compact genetic algorithm for linear functions. Natural Computing, 5:257--283, 2006.
[92]
[DS19] Benjamin Doerr and Andrew M. Sutton. When resampling to cope with noise, use median, not mean. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 242--248. ACM, 2019.
[93]
[DSW13] Benjamin Doerr, Dirk Sudholt, and Carsten Witt. When do evolutionary algorithms optimize separable functions in parallel? In Foundations of Genetic Algorithms, FOGA 2013, pages 48--59. ACM, 2013.
[94]
[DT09] Benjamin Doerr and Madeleine Theile. Improved analysis methods for crossover-based algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2009, pages 247--254. ACM, 2009.
[95]
[DW12a] Benjamin Doerr and Carola Winzen. Memory-restricted black-box complexity of OneMax. Information Processing Letters, 112:32--34, 2012.
[96]
[DW12b] Benjamin Doerr and Carola Winzen. Reducing the arity in unbiased black-box complexity. In Genetic and Evolutionary Computation Conference, GECCO 2012, pages 1309--1316. ACM, 2012.
[97]
[DW14] Benjamin Doerr and Carola Winzen. Ranking-based black-box complexity. Algorithmica, 68:571--609, 2014.
[98]
[DWY21] Benjamin Doerr, Carsten Witt, and Jing Yang. Runtime analysis for self-adaptive mutation rates. Algorithmica, 83:1012--1053, 2021.
[99]
[DWZ21] Benjamin Doerr, Shouda Wang, and Weijie Zheng. Choosing the right algorithm with hints from complexity theory. In International Joint Conference on Artificial Intelligence, IJCAI 2021. ijcai.org, 2021. To appear.
[100]
[DZ20a] Benjamin Doerr and Weijie Zheng. A parameter-less compact genetic algorithm. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 805--813. ACM, 2020.
[101]
[DZ20b] Benjamin Doerr and Weijie Zheng. Sharp bounds for genetic drift in estimation-of-distribution algorithms. IEEE Transactions on Evolutionary Computation, 24:1140--1149, 2020.
[102]
[DZ21] Benjamin Doerr and Weijie Zheng. Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In Conference on Artificial Intelligence, AAAI 2021. AAAI Press, 2021. To appear.
[103]
[EGL+19] Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, and Felix Weissenberger. The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates. Theoretical Computer Science, 785:150--170, 2019.
[104]
[EHM99] Agoston Endre Eiben, Robert Hinterding, and Zbigniew Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3:124--141, 1999.
[105]
[FGQW18a] Tobias Friedrich, Andreas Göbel, Francesco Quinzan, and Markus Wagner. Evolutionary algorithms and submodular functions: Benefits of heavy-tailed mutations. CoRR, abs/1805.10902, 2018.
[106]
[FGQW18b] Tobias Friedrich, Andreas Göbel, Francesco Quinzan, and Markus Wagner. Heavy-tailed mutation operators in single-objective combinatorial optimization. In Parallel Problem Solving from Nature, PPSN 2018, Part I, pages 134--145. Springer, 2018.
[107]
[FHH+09] Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt. Analyses of simple hybrid algorithms for the vertex cover problem. Evolutionary Computation, 17:3--19, 2009.
[108]
[FHN07] Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann. Rigorous analyses of simple diversity mechanisms. In Genetic and Evolutionary Computation Conference, GECCO 2007, pages 1219--1225. ACM, 2007.
[109]
[FHN09] Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann. Comparison of simple diversity mechanisms on plateau functions. Theoretical Computer Science, 410:2455--2462, 2009.
[110]
[FK13] Matthias Feldmann and Timo Kötzing. Optimizing expected path lengths with ant colony optimization using fitness proportional update. In Foundations of Genetic Algorithms, FOGA 2013, pages 65--74. ACM, 2013.
[111]
[FKK16] Tobias Friedrich, Timo Kötzing, and Martin S. Krejca. EDAs cannot be balanced and stable. In Genetic and Evolutionary Computation Conference, GECCO 2016, pages 1139--1146. ACM, 2016.
[112]
[FKKS17] Tobias Friedrich, Timo Kötzing, Martin S. Krejca, and Andrew M. Sutton. The compact genetic algorithm is efficient under extreme Gaussian noise. IEEE Transactions on Evolutionary Computation, 21:477--490, 2017.
[113]
[FN15] Tobias Friedrich and Frank Neumann. Maximizing submodular functions under matroid constraints by evolutionary algorithms. Evolutionary Computation, 23:543--558, 2015.
[114]
[FQW18] Tobias Friedrich, Francesco Quinzan, and Markus Wagner. Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 293--300. ACM, 2018.
[115]
[FS20] Mario Alejandro Hevia Fajardo and Dirk Sudholt. On the choice of the parameter control mechanism in the (1 + (λ, λ)) genetic algorithm. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 832--840. ACM, 2020.
[116]
[FW04] Simon Fischer and Ingo Wegener. The Ising model on the ring: mutation versus recombination. In Genetic and Evolutionary Computation, GECCO 2004, pages 1113--1124. Springer, 2004.
[117]
[FW05] Simon Fischer and Ingo Wegener. The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344:208--225, 2005.
[118]
[GGL19] Tomas Gavenciak, Barbara Geissmann, and Johannes Lengler. Sorting by swaps with noisy comparisons. Algorithmica, 81:796--827, 2019.
[119]
[GK16] Christian Gießen and Timo Kötzing. Robustness of populations in stochastic environments. Algorithmica, 75:462--489, 2016.
[120]
[GKS99] Josselin Garnier, Leila Kallel, and Marc Schoenauer. Rigorous hitting times for binary mutations. Evolutionary Computation, 7:173--203, 1999.
[121]
[Gol89] David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., 1989.
[122]
[GP14] Brian W. Goldman and William F. Punch. Parameter-less population pyramid. In Genetic and Evolutionary Computation Conference, GECCO 2014, pages 785--792. ACM, 2014.
[123]
[GW03] Oliver Giel and Ingo Wegener. Evolutionary algorithms and the maximum matching problem. In Symposium on Theoretical Aspects of Computer Science, STACS 2003, pages 415--426. Springer, 2003.
[124]
[GW17] Christian Gießen and Carsten Witt. The interplay of population size and mutation probability in the (1 + λ) EA on OneMax. Algorithmica, 78:587--609, 2017.
[125]
[GW18] Christian Gießen and Carsten Witt. Optimal mutation rates for the (1 + λ) EA on OneMax through asymptotically tight drift analysis. Algorithmica, 80:1710--1731, 2018.
[126]
[HGAK06] Nikolaus Hansen, Fabian Gemperle, Anne Auger, and Petros Koumoutsakos. When do heavy-tail distributions help? In Parallel Problem Solving from Nature, PPSN 2006, pages 62--71. Springer, 2006.
[127]
[HGD94] Jeffrey Horn, David E. Goldberg, and Kalyanmoy Deb. Long path problems. In Parallel Problem Solving from Nature, PPSN 1994, pages 149--158. Springer, 1994.
[128]
[HJKN08] Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In Genetic and Evolutionary Computation Conference, GECCO 2008, pages 953--960. ACM, 2008.
[129]
[HLG99] Georges R. Harik, Fernando G. Lobo, and David E. Goldberg. The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3:287--297, 1999.
[130]
[HS18] Václav Hasenöhrl and Andrew M. Sutton. On the runtime dynamics of the compact genetic algorithm on jump functions. In Genetic and Evolutionary Computation Conference, GECCO 2018, pages 967--974. ACM, 2018.
[131]
[HY01] Jun He and Xin Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127:51--81, 2001.
[132]
[Jäg08] Jens Jägersküpper. A blend of Markov-chain and drift analysis. In Parallel Problem Solving From Nature, PPSN 2008, pages 41--51. Springer, 2008.
[133]
[Jan07] Thomas Jansen. On the brittleness of evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2007, pages 54--69. Springer, 2007.
[134]
[Jan13] Thomas Jansen. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer, 2013.
[135]
[JJW05] Thomas Jansen, Kenneth A. De Jong, and Ingo Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13:413--440, 2005.
[136]
[JOZ13] Thomas Jansen, Pietro S. Oliveto, and Christine Zarges. Approximating vertex cover using edge-based representations. In Foundations of Genetic Algorithms, FOGA 2013, pages 87--96. ACM, 2013.
[137]
[JS05] Thomas Jansen and Ulf Schellbach. Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. In Genetic and Evolutionary Computation Conference, GECCO 2005, pages 841--848. ACM, 2005.
[138]
[JS07] Jens Jägersküpper and Tobias Storch. When the plus strategy outperforms the comma strategy and when not. In Foundations of Computational Intelligence, FOCI 2007, pages 25--32. IEEE, 2007.
[139]
[JW00] Thomas Jansen and Ingo Wegener. On the choice of the mutation probability for the (1+1) EA. In Parallel Problem Solving from Nature, PPSN 2000, pages 89--98. Springer, 2000.
[140]
[JW02] Thomas Jansen and Ingo Wegener. The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica, 34:47--66, 2002.
[141]
[JW05] Thomas Jansen and Ingo Wegener. Real royal road functions - where crossover provably is essential. Discrete Applied Mathematics, 149:111--125, 2005.
[142]
[JW06] Thomas Jansen and Ingo Wegener. On the analysis of a dynamic evolutionary algorithm. Journal of Discrete Algorithms, 4:181--199, 2006.
[143]
[JZ12] Thomas Jansen and Christine Zarges. Fixed budget computations: a different perspective on run time analysis. In Terence Soule and Jason H. Moore, editors, Genetic and Evolutionary Computation Conference, GECCO 2012, pages 1325--1332. ACM, 2012.
[144]
[JZ14a] Thomas Jansen and Christine Zarges. Performance analysis of randomised search heuristics operating with a fixed budget. Theoretical Computer Science, 545:39--58, 2014.
[145]
[JZ14b] Thomas Jansen and Christine Zarges. Reevaluating immune-inspired hypermutations using the fixed budget perspective. IEEE Transactions on Evolutionary Computation, 18:674--688, 2014.
[146]
[KAD19] Vitalii Karavaev, Denis Antipov, and Benjamin Doerr. Theoretical and empirical study of the (1 + (λ, λ)) EA on the Leading-Ones problem. In Genetic and Evolutionary Computation Conference, GECCO 2019, Companion Material, pages 2036--2039. ACM, 2019.
[147]
[KHE15] Giorgos Karafotias, Mark Hoogendoorn, and Ágoston E. Eiben. Parameter control in evolutionary algorithms: trends and challenges. IEEE Transactions on Evolutionary Computation, 19:167--187, 2015.
[148]
[KLNO10] Stefan Kratsch, Per Kristian Lehre, Frank Neumann, and Pietro Simone Oliveto. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation. In Parallel Problem Solving from Nature, PPSN 2010, Part I, pages 204--213. Springer, 2010.
[149]
[KLW15] Timo Kötzing, Andrei Lissovoi, and Carsten Witt. (1+1) EA on generalized dynamic OneMax. In Foundations of Genetic Algorithms, FOGA 2015, pages 40--51. ACM, 2015.
[150]
[KN13] Stefan Kratsch and Frank Neumann. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica, 65:754--771, 2013.
[151]
[KST11] Timo Kötzing, Dirk Sudholt, and Madeleine Theile. How crossover helps in pseudo-Boolean optimization. In Genetic and Evolutionary Computation Conference, GECCO 2011, pages 989--996. ACM, 2011.
[152]
[KW20a] Timo Kötzing and Carsten Witt. Improved fixed-budget results via drift analysis. In Parallel Problem Solving from Nature, PPSN 2020, Part II, pages 648--660. Springer, 2020.
[153]
[KW20b] Martin S. Krejca and Carsten Witt. Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax. Theoretical Computer Science, 832:143--165, 2020.
[154]
[Leh10] Per Kristian Lehre. Negative drift in populations. In Parallel Problem Solving from Nature, PPSN 2010, pages 244--253. Springer, 2010.
[155]
[Leh11] Per Kristian Lehre. Fitness-levels for non-elitist populations. In Genetic and Evolutionary Computation Conference, GECCO 2011, pages 2075--2082. ACM, 2011.
[156]
[Len20] Johannes Lengler. A general dichotomy of evolutionary algorithms on monotone functions. IEEE Transactions Evolutionary Computation, 24:995--1009, 2020.
[157]
[LM20] Johannes Lengler and Jonas Meier. Large population sizes and crossover help in dynamic environments. In Parallel Problem Solving from Nature, PPSN 2020, Part I, pages 610--622. Springer, 2020.
[158]
[LMS19] Johannes Lengler, Anders Martinsson, and Angelika Steger. When does hillclimbing fail on monotone functions: an entropy compression argument. In Analytic Algorithmics and Combinatorics, ANALCO 2019, pages 94--102. SIAM, 2019.
[159]
[LN17] Per Kristian Lehre and Phan Trung Hai Nguyen. Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration. In Genetic and Evolutionary Computation Conference, GECCO 2017, pages 1383--1390. ACM, 2017.
[160]
[LN18] Per Kristian Lehre and Phan Trung Hai Nguyen. Level-based analysis of the population-based incremental learning algorithm. In Parallel Problem Solving From Nature, PPSN 2018, pages 105--116. Springer, 2018.
[161]
[LN19a] Per Kristian Lehre and Phan Trung Hai Nguyen. On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. In Foundations of Genetic Algorithms, FOGA 2019, pages 154--168. ACM, 2019.
[162]
[LN19b] Per Kristian Lehre and Phan Trung Hai Nguyen. Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise. In Genetic and Evolutionary Computation Conference, GECCO 2019, pages 1497--1505. ACM, 2019.
[163]
[LOW19] Andrei Lissovoi, Pietro S. Oliveto, and John Alasdair Warwicker. On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation. In Conference on Artificial Intelligence, AAAI 2019, pages 2322--2329. AAAI Press, 2019.
[164]
[LOW20] Andrei Lissovoi, Pietro S. Oliveto, and John Alasdair Warwicker. Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for LeadingOnes*. Evolutionary Computation, 28:437--461, 2020.
[165]
[LS11] Jörg Lässig and Dirk Sudholt. Adaptive population models for offspring populations and parallel evolutionary algorithms. In Foundations of Genetic Algorithms, FOGA 2011, pages 181--192. ACM, 2011.
[166]
[LS15] Johannes Lengler and Nicholas Spooner. Fixed budget performance of the (1+1) EA on linear functions. In Foundations of Genetic Algorithms, FOGA 2015, pages 52--61. ACM, 2015.
[167]
[LS18] Johannes Lengler and Angelika Steger. Drift analysis and evolutionary algorithms revisited. Combinatorics, Probability & Computing, 27:643--666, 2018.
[168]
[LSW21] Johannes Lengler, Dirk Sudholt, and Carsten Witt. The complex parameter landscape of the compact genetic algorithm. Algorithmica, 83:1096--1137, 2021.
[169]
[LW12] Per Kristian Lehre and Carsten Witt. Black-box search by unbiased variation. Algorithmica, 64:623--642, 2012.
[170]
[LW16] Andrei Lissovoi and Carsten Witt. MMAS versus population-based EA on a family of dynamic fitness functions. Algorithmica, 75:554--576, 2016.
[171]
[LY11] Per Kristian Lehre and Xin Yao. Crossover can be constructive when computing unique input-output sequences. Soft Computing, 15:1675--1687, 2011.
[172]
[LY12] Per Kristian Lehre and Xin Yao. On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 16:225--241, 2012.
[173]
[LZ19] Johannes Lengler and Xun Zou. Exponential slowdown for larger populations: the (μ + 1)-EA on monotone functions. In Foundations of Genetic Algorithms, FOGA 2019, pages 87--101. ACM, 2019.
[174]
[Müh92] Heinz Mühlenbein. How genetic algorithms really work: mutation and hillclimbing. In Parallel Problem Solving from Nature, PPSN 1992, pages 15--26. Elsevier, 1992.
[175]
[Neu04] Frank Neumann. Expected runtimes of evolutionary algorithms for the eulerian cycle problem. In Congress on Evolutionary Computation, CEC 2004, pages 904--910. IEEE, 2004.
[176]
[NNS17] Samadhi Nallaperuma, Frank Neumann, and Dirk Sudholt. Expected fitness gains of randomized search heuristics for the traveling salesperson problem. Evolutionary Computation, 25, 2017.
[177]
[NOW09] Frank Neumann, Pietro S. Oliveto, and Carsten Witt. Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In Genetic and Evolutionary Computation Conference, GECCO 2009, pages 835--842. ACM, 2009.
[178]
[NT10] Frank Neumann and Madeleine Theile. How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem. In Parallel Problem Solving from Nature, PPSN 2010, Part I, pages 667--676. Springer, 2010.
[179]
[NW07] Frank Neumann and Ingo Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378:32--40, 2007.
[180]
[NW10] Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, 2010.
[181]
[Och02] Gabriela Ochoa. Setting the mutation rate: scope and limitations of the 1/L heuristic. In Genetic and Evolutionary Computation Conference, GECCO 2002, pages 495--502. Morgan Kaufmann, 2002.
[182]
[OHY09] Pietro S. Oliveto, Jun He, and Xin Yao. Analysis of the (1+1)-EA for finding approximate solutions to vertex cover problems. IEEE Transactions on Evolutionary Computation, 13:1006--1029, 2009.
[183]
[OSW20] Pietro S. Oliveto, Dirk Sudholt, and Carsten Witt. A tight lower bound on the expected runtime of standard steady state genetic algorithms. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1323--1331. ACM, 2020.
[184]
[OSZ19] Pietro S. Oliveto, Dirk Sudholt, and Christine Zarges. On the benefits and risks of using fitness sharing for multimodal optimisation. Theoretical Computer Science, 773:53--70, 2019.
[185]
[OW15] Pietro S. Oliveto and Carsten Witt. Improved time complexity analysis of the simple genetic algorithm. Theoretical Computer Science, 605:21--41, 2015.
[186]
[Pos09] Petr Posik. BBOB-benchmarking a simple estimation of distribution algorithm with Cauchy distribution. In Genetic and Evolutionary Computation Conference, GECCO 2009, Companion Material, pages 2309--2314. ACM, 2009.
[187]
[Pos10] Petr Posík. Comparison of Cauchy EDA and BIPOP-CMA-ES algorithms on the BBOB noiseless testbed. In Genetic and Evolutionary Computation Conference, GECCO 2010, Companion Material, pages 1697--1702. ACM, 2010.
[188]
[Prü04] Adam Prügel-Bennett. When a genetic algorithm outperforms hill-climbing. Theoretical Computer Science, 320:135--153, 2004.
[189]
[QBJT19] Chao Qian, Chao Bian, Wu Jiang, and Ke Tang. Running time analysis of the (1 + 1)-EA for OneMax and LeadingOnes under bit-wise noise. Algorithmica, 81:749--795, 2019.
[190]
[RS14] Jonathan E. Rowe and Dirk Sudholt. The choice of the offspring population size in the (1, λ) evolutionary algorithm. Theoretical Computer Science, 545:20--38, 2014.
[191]
[Rud96] Günter Rudolph. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation, 4:195--205, 1996.
[192]
[RW20a] Amirhossein Rajabi and Carsten Witt. Evolutionary algorithms with self-adjusting asymmetric mutation. In Parallel Problem Solving from Nature, PPSN 2020, Part I, pages 664--677. Springer, 2020.
[193]
[RW20b] Amirhossein Rajabi and Carsten Witt. Self-adjusting evolutionary algorithms for multimodal optimization. In Genetic and Evolutionary Computation Conference, GECCO 2020, pages 1314--1322. ACM, 2020.
[194]
[RW21a] Amirhossein Rajabi and Carsten Witt. Stagnation detection in highly multimodal fitness landscapes. In Genetic and Evolutionary Computation Conference, GECCO 2021. ACM, 2021. To appear.
[195]
[RW21b] Amirhossein Rajabi and Carsten Witt. Stagnation detection with randomized local search. In Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, pages 152--168. Springer, 2021.
[196]
[RWP08] J. Neal Richter, Alden H. Wright, and John Paxton. Ignoble trails - where crossover is provably harmful. In Parallel Problem Solving from Nature, PPSN 2008, pages 92--101. Springer, 2008.
[197]
[SGS11] Tom Schaul, Tobias Glasmachers, and Jürgen Schmidhuber. High dimensions and heavy tails for natural evolution strategies. In Genetic and Evolutionary Computation Conference, GECCO 2011, pages 845--852. ACM, 2011.
[198]
[SH87] Harold H. Szu and Ralph L. Hartley. Fast simulated annealing. Physics Letters A, 122:157--162, 1987.
[199]
[Sha02] Jonathan L. Shapiro. The sensitivity of PBIL to its learning rate, and how detailed balance can remove it. In Foundations of Genetic Algorithms, FOGA 2002, pages 115--132. Morgan Kaufmann, 2002.
[200]
[Sha05] Jonathan L. Shapiro. Drift and scaling in estimation of distribution algorithms. Evolutionary Computing, 13:99--123, 2005.
[201]
[Sha06] Jonathan L. Shapiro. Diversity loss in general estimation of distribution algorithms. In Parallel Problem Solving from Nature, PPSN 2006, pages 92--101. Springer, 2006.
[202]
[SN12] Andrew M. Sutton and Frank Neumann. A parameterized runtime analysis of evolutionary algorithms for the Euclidean traveling salesperson problem. In AAAI Conference on Artificial Intelligence, AAAI 2012. AAAI Press, 2012.
[203]
[SNN14] Andrew M. Sutton, Frank Neumann, and Samadhi Nallaperuma. Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evolutionary Computation, 22:595--628, 2014.
[204]
[ST12] Dirk Sudholt and Christian Thyssen. A simple ant colony optimizer for stochastic shortest path problems. Algorithmica, 64:643--672, 2012.
[205]
[Sto06] Tobias Storch. How randomized search heuristics find maximum cliques in planar graphs. In Genetic and Evolutionary Computation Conference, GECCO 2006, pages 567--574. ACM, 2006.
[206]
[Sto07] Tobias Storch. Finding large cliques in sparse semi-random graphs by simple randomized search heuristics. Theoretical Computer Science, 386:114--131, 2007.
[207]
[Sto08] Tobias Storch. On the choice of the parent population size. Evolutionary Computation, 16:557--578, 2008.
[208]
[STW04] Jens Scharnow, Karsten Tinnefeld, and Ingo Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3:349--366, 2004.
[209]
[Sud05] Dirk Sudholt. Crossover is provably essential for the Ising model on trees. In Genetic and Evolutionary Computation Conference, GECCO 2005, pages 1161--1167. ACM, 2005.
[210]
[Sud13] Dirk Sudholt. A new method for lower bounds on the running time of evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 17:418--435, 2013.
[211]
[Sud17] Dirk Sudholt. How crossover speeds up building block assembly in genetic algorithms. Evolutionary Computation, 25:237--274, 2017.
[212]
[Sud21] Dirk Sudholt. Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial. Algorithmica, 83:976--1011, 2021.
[213]
[Sut21] Andrew M. Sutton. Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem. Algorithmica, 83:1138--1163, 2021.
[214]
[SW04] Tobias Storch and Ingo Wegener. Real royal road functions for constant population size. Theoretical Computer Science, 320:123--134, 2004.
[215]
[SW19] Dirk Sudholt and Carsten Witt. On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization. Algorithmica, 81:1450--1489, 2019.
[216]
[SZ10] Dirk Sudholt and Christine Zarges. Analysis of an iterated local search algorithm for vertex coloring. In International Symposium on Algorithms and Computation, ISAAC 2010, Part I, pages 340--352. Springer, 2010.
[217]
[Wit05] Carsten Witt. Worst-case and average-case approximations by simple randomized search heuristics. In Symposium on Theoretical Aspects of Computer Science, STACS 2005, pages 44--56. Springer, 2005.
[218]
[Wit06] Carsten Witt. Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14:65--86, 2006.
[219]
[Wit13] Carsten Witt. Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combinatorics, Probability & Computing, 22:294--318, 2013.
[220]
[Wit14] Carsten Witt. Revised analysis of the (1+1) EA for the minimum spanning tree problem. In Genetic and Evolutionary Computation Conference, GECCO 2014, pages 509--516. ACM, 2014.
[221]
[Wit19] Carsten Witt. Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. Algorithmica, 81:632--667, 2019.
[222]
[WJ07] Richard A. Watson and Thomas Jansen. A building-block royal road where crossover is provably essential. In Genetic and Evolutionary Computation Conference, GECCO 2007, pages 1452--1459. ACM, 2007.
[223]
[WQT18] Mengxi Wu, Chao Qian, and Ke Tang. Dynamic mutation based Pareto optimization for subset selection. In Intelligent Computing Methodologies, ICIC 2018, Part III, pages 25--35. Springer, 2018.
[224]
[YL97] Xin Yao and Yong Liu. Fast evolution strategies. In Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, pages 151--162. Springer, 1997.
[225]
[YLL99] Xin Yao, Yong Liu, and Guangming Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3:82--102, 1999.
- A gentle introduction to theory (for non-theoreticians)
Recommendations
Exergy Analysis of Transcritical Carbon Dioxide Refrigeration Cycle with an Ejector
CDCIEM '11: Proceedings of the 2011 International Conference on Computer Distributed Control and Intelligent Environmental MonitoringThe throttling loss is the major loss of the transcritical carbon dioxide refrigeration cycle, and the reason of low efficiency for performance. The study on the transcritical carbon dioxide refrigeration cycle with ejector and with throttling valve has ...
Analysis on Influence of Environmental Factors to the Heat Loss of Petrochemical Heating Furnace Wall
ISIC '11: Proceedings of the 2011 International Conference on Information Security and Intelligence ControlAs some workers in petrochemical enterprise usually take the outside wall temperature as a standard to determine the thermal insulation effects of the equipments, this paper discussed the influence of environment factors, as the temperature and wind ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2021
2047 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2021
Check for updates
Qualifiers
- Tutorial
Funding Sources
Conference
GECCO '21
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 124Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in