锦标赛选拔
计算机科学
选择(遗传算法)
早熟收敛
适应度比例选择
趋同(经济学)
人口
锦标赛
班级(哲学)
简单(哲学)
数学优化
适应度函数
理论计算机科学
人工智能
机器学习
遗传算法
数学
认识论
组合数学
哲学
社会学
人口学
经济
经济增长
作者
Filippo Menczer,Richard K. Belew
摘要
Local selection (LS) is a very simple selection scheme in evolutionary algorithms. Individual fitnesses are compared to a fixed threshold, rather than to each other, to decide who gets to reproduce. LS, coupled with fitness functions stemming from the consumption of shared environmental resources, maintains diversity in a way similar to fitness sharing; however it is generally more efficient than fitness sharing, and lends itself to parallel implementations for distributed tasks. While LS is not prone to premature convergence, it applies minimal selection pressure upon the population. LS is therefore more appropriate than other, stronger selection schemes only on certain problem classes. This papers characterizes one broad class of problems in which LS consistently out-performs tournament selection.
科研通智能强力驱动
Strongly Powered by AbleSci AI