The gambler's ruin problem, genetic algorithms, and the sizing of populations

被引：97

作者：

Harik, G

CantuPaz, E

Goldberg, DE

Miller, BL

机构：

来源：

PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97) | 1997年

关键词：

D O I：

10.1109/ICEC.1997.592259

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents a model for predicting the convergence quality of genetic algorithms. The model incorporates previous knowledge about decision making in genetic algorithms and the initial supply of building blocks in a novel way. The result is an equation that accurately predicts the quality of the solution found by a GA using a given population size. Adjustments for different selection intensities are considered and computational experiments demonstrate the effectiveness of the model.

引用

页码：7 / 12

页数：6