求解0-1规划问题的改进差分进化算法  

Improved Differential Evolution Algorithm for Solving 0-1Programming Problems

作　　者：宁桂英[1] 曹敦虔 周永权 NING Guiying;CAO Dunqian;ZHOU Yongquan(Lushan College of Guangxi University Science and Technology, Liuzhou 545616;College of Science, Guangxi University for Nationalities, Nanning 530006;College of Information Science and Engineering, Guangxi University for Nationalities, Nanning 530006)

机构地区：[1]广西科技大学鹿山学院,柳州545616 [2]广西民族大学理学院,南宁530006 [3]广西民族大学信息科学与工程学院,南宁530006

出　　处：《系统科学与数学》2019年第1期120-132,共13页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金(61463007);2015年度广西高校科学技术研究项目(KY2015YB521)资助课题

摘　　要：针对0-1规划问题,提出了一种新的智能优化方法——差分进化算法.首先利用佳点集法产生初始种群,大大提高了种群的多样性,再用牵引法处理约束条件,将进化中的不可行解逐步引入到可行解集,克服了罚函数法选择罚因子的困难,最后对10个0-1规划问题的算例进行测试,并将测试结果与其它算法进行了比较,结果表明:文章提出的算法具有较快的寻优能力和较好的全局搜索能力,是求解0-1规划问题的一种有效方法.A new intelligent optimization method-Differential evolution algorithm is proposed to solve 0-1 Programming Problems. Firstly, the initial population is generated by using the good point set method, which greatly increases the diversity of the population. Then the traction method is used to deal with the constraint conditions. In this way, the evolving infeasible solution is gradually introduced into the feasible solution set. This overcomes the difficulty of selecting penalty factors by penalty function method. Ten 0-1 programming problems are tested, and the test results are compared with other algorithms. The results show that the proposed algorithm has faster searching ability and better global search ability 0-1. It is an effective way to solve the 0-1 programming problem.

关 键 词：0-1规划问题 佳点集 差分进化 可行解 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] O221[自动化与计算机技术—控制科学与工程]