首页 | 本学科首页   官方微博 | 高级检索  
     


Convergence of genetic algorithms
Authors:R. R. Sharapov  A. V. Lapshin
Affiliation:(1) Ural State Technical University, pr. Lenina 51, Yekaterinburg, 630083, Russia
Abstract:The mean convergence of various versions of a genetic algorithm are considered. A number of convergence statements are formulated and relevant estimates are obtained. A hypothesis concerning the form of these estimates under variation of the structure of a genetic algorithm is put forward. Roman Riviyanovich Sharapov. Born 1981. Graduated from the Faculty of Mechanics and Mathematics, Ural State University, in 2003. Presently, a postgraduate at the Department of Mathematical Economics at the same university. Scientific interests: genetic algorithms, neural networks, and financial mathematics. Aleksandr Vyacheslavovich Lapshin. Born 1980. Graduated from the Faculty of Mechanics and Mathematics, Ural State University, in 2003. Presently, a postgraduate at the Department of Mathematical Economics at the same university. Scientific interests: financial mathematics, genetic algorithms, and neural networks.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号