摘要
选择操作是遗传算法中体现“适者生存”的关键一环．最常用的选择方式是“轮盘赌”法．其传统实现建立在逐项比较的基础上，算法复杂度为Ｏ（ｎ２）．通过把各码链适应值转换为一组具有线性序的区间，从而可利用二分查找法实现“轮盘赌”选择操作的递归算法，使时间复杂度下降到Ｏ（ｎｌｏｇ２ｎ）．
Selection operation in genetic algorithms is an important step which models the natural phenomenon of “the survival of the fittest”. The scheme of roulette wheel selection is used in most of the time. By implementing recurrence in roulette wheel seletion, the paper reduces the time complexity from classical O(n 2 ) to O(n log 2 n) .
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1998年第4期89-91,共3页
Journal of Shanghai Jiaotong University
基金
国家九五重点科技攻关MCM-CAD技术研究基金项目
关键词
选择操作
遗传算法
递归
selection operation
roulette wheel selection scheme
genetic algorithm
recursive implementation
