Comparison of certain evolutionary algorithms

Automation and Remote Control

Volumn 65, Issue 3, 2004, Pages 357-362

  Borisovskii, P A ^a   Eremeev, A V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; INTEGRATION; MATHEMATICAL OPERATORS; OPTIMIZATION; PATTERN RECOGNITION; THEOREM PROVING;

LOCAL RANDOM SEARCH ALGORITHMS; PROBABILISTIC MUTATION PROCEDURE; RECOMPUTATION;

GENETIC ALGORITHMS;

EID: 84904240194     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AURC.0000019365.10288.58     Document Type: Article

References (18)

1. Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Reading: Addison Wesley, 1989.
2. Reeves, C.R., Genetic Algorithms for the Operations Researcher, INF J. Comput., 1997, vol. 9, no. 3, pp. 231-250.
3. Rechenberg, I., Evolutionsstrategie: optimerung technischer Systeme nach Prinzipen der Biologischen Evolution, Stuttgart: Formann-Holzboog Verlag, 1973.
4. Koza, J.R., Genetic Programming II: Automatic Discovery of Reusable Programs (Complex Adaptive Systems), Cambrige: MIT Press, 1994.
5. Darwin, C.R., On the Origin of Species, London: Cloves, 1860.
6. Beyer, H.-G., The Theory of Evolution Strategies. Natural Computing Series, Heidelberg: Springer, 2001.
7. Reeves, C.R. and Rowe, J.E., Genetic Algorithms: Principles and Perspectives, Norwell: Kluwer, 2002.
8. Vose, M.D., The Simple Genetic Algorithm: Foundations and Theory, Cambridge: MIT Press, 1999.
9. Rastrigin, L.A., Statisticheskie metody poiska (Statistical Search Methods), Moscow: Nauka, 1968.
10. Johnson, D.S., Aragon, C.R., McGeoch, L.A., and Schevon, C., Optimization by Simulated Annealing: An Experimental Evaluation. Part I. Graph Partitioning, Oper. Res., 1989, vol. 37, no. 6, pp. 865-892.
11. Borisovsky, P.A. and Eremeev, A.V., A Study on Performance of the (1+1)-Evolutionary Algorithm, in Foundations of Genetic Algorithms 7, De Jong, K., Poli R., and Rowe. J., Eds., San Francisco: Morgan Kaufmann, 2003.
12. Motwani, R. and Raghavan, P., Randomized Algorithms, Cambrige: Cambridge Univ. Press, 1995.
13. Rudolph, G., Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon, Fundamenta Inf., 1998, vol. 35, no. 1-4, pp. 67-89.
14. Ermeev, A.V., Genetic Algorithms for Covering Problems, Diskret. Analiz Issl. Operatsii, 2000, vol. 7, no. 1, pp. 47-60.
15. Eremeev, A.V., Modeling and Analysis of Genetic Algorithms with Tournament Selection, in Proc. Artificial Evolution Conference (AE'99), Fonlupt, C., et al., Eds., Dunkerque: Springer Verlag, 2000, vol. 1829, pp. 84-95.
16. Aldous, D. and Vazirani, U.U., "Go with the Winners" Algorithms, Proc. IEEE Sympos, Foundations Comput. Sci., 1994, pp. 492-501.
17. Balas, E., A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers, Math. Oper. Res., 1984, vol. 9, no. 1, pp. 1-5.
18. Borisovsky, P.A. and Zavolovskaya, M.S., Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem, in Application of Evolutionary Computers, Proc. Evo Workshops 2003, Cagnoni, S., et al., Eds., Essex: Springer Verlag, 2003, vol. 2611, pp. 154-164.