Random heuristic search: applications to GAs and functions of unitation

被引：4
作者：
Vose, MD
Rowe, JE
机构：
[1] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA
[2] De Montfort Univ, Dept Comp & Informat Sci, Artificial Intelligence Grp, Milton Keynes MK7 6HP, Bucks, England
来源：
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING | 2000年 / 186卷 / 2-4期
关键词：
random heuristic search; modeling evolutionary algorithms; functions of unitation;
D O I：
10.1016/S0045-7825(99)00384-9
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Describing a wide range of search methods at various levels of detail, the theory of random heuristic search speaks of their qualitative and quantitative aspects. This paper begins by outlining the theory, reviewing some of the more basic principles and results, and then goes on to illustrate its application by presenting both fine-grained and coarse-grained models for a genetic algorithm applied to functions of unitation. Particular emphasis is given to the interrelationships between the models. (C) 2000 Elsevier Science S.A. All rights reserved.
引用
收藏
页码：195 / 220
页数：26
相关论文
共 33 条
[1]  
Akin E, 1993, GEN TOPOLOGY DYNAMIC, V1
[2]  
[Anonymous], 1971, ALGEBRA
[3]  
BRIDGES CL, 1987, P 2 INT C GEN ALG, P9
[4]  
Cox DA, 1996, IDEALS VARIETIES ALG
[5]  
EBERLEIN M, 1996, THESIS U TENNESSEE
[6]  
Feller W., 1968, INTRO PROBABILITY TH
[7]  
GANTMACHER FR, 1997, MATRIX THEORY
[8]  
Goldberg D. E., 1992, Complex Systems, V6, P333
[9]  
Holland J., 1992, ADAPTATION NATURAL A
[10]   The Genetic Algorithm Fractal [J].
Juliany, Jenny ;
Vose, Michael D. .
EVOLUTIONARY COMPUTATION, 1994, 2 (02) :165-180
1234