首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于GAs求解整数规划问题的算法设计
引用本文:刘树安,郑秉霖,王梦光.基于GAs求解整数规划问题的算法设计[J].东北大学学报(自然科学版),1998,19(2):198-200.
作者姓名:刘树安  郑秉霖  王梦光
作者单位:东北大学信息科学与工程学院,沈阳,110006
基金项目:国家科技攻关项目,85-720-03-06,
摘    要:对于遗传算法(GAs)求解整数规划问题,提出一种新的位串编码结构,采用一种新的加速变异算子,可明显改善寻优的收敛速度,并为保持种群多样性引入分散型淘汰法。

关 键 词:组合优化  遗传算法  整数规划  加速变异算子  分散型淘汰法

Algorithm Design Based on Genetic Algorithm for Integer Programming Problem
Liu Shuan,Zheng Binglin,Wang Mengguang.Algorithm Design Based on Genetic Algorithm for Integer Programming Problem[J].Journal of Northeastern University(Natural Science),1998,19(2):198-200.
Authors:Liu Shuan  Zheng Binglin  Wang Mengguang
Abstract:An algorithm is designed based on genetic algorithms for integer programming problem. A new structure of chromosome is proposed for solving integer programming problem. In order to improve the convergence of finding the best solution,a new mutation operator,speed up mutation operator is designed and simulating test proves to be effective. Niche method is introduced into the proposed algorithm to maintain the diversity of population.
Keywords:combinatorial optimization  genetic algorithm  integer programming  speed up mutation operator  niche method    
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号