作者: Q. Tuan Pham
关键词: Selection (genetic algorithm) 、 Improvement rate 、 Population 、 Artificial intelligence 、 Mathematical optimization 、 Engineering 、 Natural approach 、 Survival of the fittest 、 Operator (computer programming)
摘要: One of the main problems in applying evolutionary optimisation methods is choice operators and parameter values. This paper propose a competitive evolution method, which several subpopulations are allowed to compete for computer time. The population with fittest members, that highest improvement rate recent past, rewarded.