Operator and parameter adaptation in genetic algorithms

被引:132
作者
J. E. Smith
T. C. Fogarty
机构
[1] Intelligent Computer Systems Centre,
[2] Faculty of Computer Studies & Mathematics,undefined
[3] University of the West of England,undefined
[4] Bristol,undefined
[5] BS16 1QY e-mail jim@btc.uwe.ac.uk,undefined
[6] Department of Computer Studies,undefined
[7] Napier University Craiglockhart Campus,undefined
[8] 219 Collinton Road,undefined
[9] Edinburgh EH14 1DG e-mail T.Fogarty@dcs.napier.ac.uk,undefined
关键词
Keywords: “genetic algorithms” parameters; operators; adaptation; self-adaptive;
D O I
10.1007/s005000050009
中图分类号
学科分类号
摘要
 Genetic Algorithms are a class of powerful, robust search techniques based on genetic inheritance and the Darwinian metaphor of “Natural Selection”. These algorithms maintain a finite memory of individual points on the search landscape known as the “population”. Members of the population are usually represented as strings written over some fixed alphabet, each of which has a scalar value attached to it reflecting its quality or “fitness”. The search may be seen as the iterative application of a number of operators, such as selection, recombination and mutation, to the population with the aim of producing progressively fitter individuals.
引用
收藏
页码:81 / 87
页数:6
相关论文
empty
未找到相关数据