A survey of optimization by building and using probabilistic models

被引:395
作者
Pelikan, M [1 ]
Goldberg, DE [1 ]
Lobo, FG [1 ]
机构
[1] Univ Illinois, Dept Gen Engn, Illinois Genet Algorithms Lab, Urbana, IL 61801 USA
关键词
genetic and evolutionary computation; genetic algorithms; model building; decomposable problems; stochastic optimization;
D O I
10.1023/A:1013500812258
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper summarizes the research on population-based probabilistic search algorithms based on modeling promising solutions by estimating their probability distribution and using the constructed model to guide the exploration of the search space. It settles the algorithms in the field of genetic and evolutionary computation where they have been originated, and classifies them into a few classes according to the complexity of models they use. Algorithms within each class are briefly described and their strengths and weaknesses are discussed.
引用
收藏
页码:5 / 20
页数:16
相关论文
共 43 条
[1]  
[Anonymous], THESIS KATHOLIEKE U
[2]  
Baluja S, 1994, Technical Report
[3]  
Baluja S., 1997, Proceedings of the 14'th International Conference on Machine Learning, P30
[4]  
BOSMAN PA, 2000, COMMUNICATION
[5]  
Bosman PAN, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P60
[6]  
Deb K., 1995, Complex Systems, V9, P115
[7]  
DeBonet JS, 1997, ADV NEUR IN, V9, P424
[8]   OPTIMUM BRANCHINGS [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :233-+
[9]  
ESHELMAN LJ, 1992, FDN GEN ALG WORKSH F
[10]  
Etxeberria R., 1999, Proceedings of the Second Symposium on Artificial Intelligence (CIMAF-99), P332