Comparing evolutionary algorithms to the (1+1) -EA

Theoretical Computer Science

Volumn 403, Issue 1, 2008, Pages 33-41

  Borisovsky, P A ^a   Eremeev, A V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Comparison; Domination; Evolutionary algorithm; Monotonicity; Optimization

Indexed keywords

BOOLEAN FUNCTIONS; CONTROL THEORY; FUNCTION EVALUATION; ITERATIVE METHODS; MILITARY DATA PROCESSING; OPTIMIZATION;

(1+1) EVOLUTIONARY ALGORITHMS; (I ,J) CONDITIONS; ELSEVIER (CO); EXPECTED OPTIMIZATION TIME; FITNESS FUNCTIONS; HILL-CLIMBING ALGORITHMS; LOWER BOUNDS; MUTATION OPERATORS; REPRODUCTION OPERATOR; SEARCH STRATEGIES;

EVOLUTIONARY ALGORITHMS;

EID: 47949087838     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.03.008     Document Type: Article

References (22)

1. D. Aldous, U.U. Vazirani, Go with the winners algorithms, in: Proceedings of FOCS 1994, 1994, 492-501
2. n - search spaces disturbed by noise. Theoret. Comput. Sci. 289 (2001) 629-647
3. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European J. Oper. Res. 94 2 (1996) 394-404
4. Beyer H.-G. The Theory of Evolution Strategies, Natural Computing Series (2001), Springer, Heidelberg
5. Beyer H.-G., Schwefel H.-P., and Wegener I. How to analyse evolutionary algorithms. Theoret. Comput. Sci. 287 (2002) 101-130
6. Borisovsky P.A., and Eremeev A.V. A study on performance of the (1~+~1)-evolutionary algorithm. In: De Jong K., Poli R., and Rowe J. (Eds). Foundations of Genetic Algorithms, vol. 7 (2003), Morgan Kaufmann, San Francisco 271-287
7. Borisovskii P.A., and Eremeev A.V. Comparison of certain evolutionary algorithms. Avtomatika i Telemekh. 3 (2004) 3-10
8. Borisovskii P.A., and Eremeev A.V. Comparison of certain evolutionary algorithms. Automation Remote Control. 65 3 (2004) 357-362
9. Borisovsky P.A., and Zavolovskaya M.S. Experimental comparison of two evolutionary algorithms for the independent set problem. In: Cagnoni S., et al. (Ed). Applications of Evolutionary Computing: Proc. of EvoWorkshops. LNCS vol. 2611 (2003), Springer Verlag 154-164
10. Borovkov A.A. Probability Theory (1998), Gordon and Breach
11. Daley D.J. Stochastically monotone Markov chains. Z. Wahrscheinlickeitstheorie Verw. Gebiete 10 (1968) 307-317
12. Droste S., Jansen T., Tinnefeld K., and Wegener I. A new framework for the valuation of algorithms for black-box optimization. In: De Jong K., Poli R., and Rowe J. (Eds). Foundations of Genetic Algorithms, vol. 7 (2003), Morgan Kaufmann, San Francisco 253-270
13. Eremeev A.V. Modeling and analysis of genetic algorithm with tournament selection. In: Fonlupt C., et al. (Ed). Proc. of Artificial Evolution Conference (AE'99). LNCS vol. 1829 (2000), Springer Verlag 84-95
14. Gnedenko B.V. Theory of Probability (1997), Gordon and Breach
15. Holland J. Adaptation in Natural and Artificial Systems (1975), University of Michigan Press
16. T. Jansen, I. Wegener, On the utility of populations in evolutionary algorithms, in: Proc. of Genetic and Evolutionary Computation Conference, GECCO, 2001, pp. 1034-1041
17. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
18. Koza J.R. Genetic programming: On the Programming of Computers by Means of Natural Selection (1992), MIT Press
19. Rechenberg I. Evolutionsstrategie: Optimerung Technischer Systeme nach Prinzipen der Biologischen Evolution (1973), Formann-Holzboog Verlag, Stuttgart
20. Rudolph G. Finite Markov chain results in evolutionary computation: A tour d'horizon. Fund. Inform. 35 1-4 (1998) 67-89
21. Stoyan D. Comparison Methods for Queues and Other Stochastic Models (1983), John Wiley & Sons
22. Scharnow J., Tinnefeld K., and Wegener I. The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Mod. Algorithms 3 (2004) 349-366