摘要
介绍了一种改进的遗传算法,给出了应用该算法的具体步骤。该算法通过使用二元染色体编码方式,利用基因处于不同状态的概率来表示等位基因,既使染色体具有了更多的信息量,又能够保证遗传算法的收敛性。通过旋转变换实现了染色体的进化,提高了算法的全局搜索能力和收敛速度。并利用组合优化中典型的背包问题对算法进行了验证,并和基本遗传算法的结果进行了比较。
An improved genetic algorithm is introduced and its procedure is provided in detail. The algorithm provides the chromosome with more amount of information and ensures the convergence by using binary chromosome and expressing alleges with the probability of the gene in different states. The chromosome is evolved through rotation. Global search capability and convergence speed are improved. The effectiveness of the improved approach is demonstrated based on its application to knapsack problem.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2005年第4期718-719,747,共3页
Systems Engineering and Electronics
关键词
遗传算法
二元染色体编码
背包问题
收敛速度
genetic algorithm
binary chromosome coding
knapsack problem
comvergence speed
