摘要
鉴于差分进化算法在解决复杂连续问题上的优良性能,针对0-1变量的特点,提出了一种用于求解0-1规划问题的二进制差分进化算法(BDEPM).与采用离散变换和逻辑运算的改进算法相比,BDEPM算法中的变量采用二进制编码方式,在进化过程中无需变异率,即可根据个体间的差异直接在离散域内进行变异,算法的思路清晰、结构简单、控制参数少、易于理解和实现.将BDEPM用于求解0-1背包问题,针对其约束提出了一种二次贪婪变换的修复策略,两个背包实例的仿真对比实验验证了BDEPM算法的优越性.
Owing to the superior performance on dealing with the complicated continuous problems, a binary differential evolution algorithm named BDEPM was proposed to solve 0-1 programming problem on account of characteristics of the 0-1 variables. Compared with discrete transform and logical operations, in the proposed method, the scaling factor was not required in the evolutionary process and binary mutation was directly carried out only on the basis of the differences between two individuals. The binary coded BDEPM algorithm was easy to understand, and it was implemented with a simple structure and less control parameters. A repair strategy based on quadratic greedy transform was put forward to handle the constraints when the BDEPM algorithm was applied to the solve 0-1 knapsack problems. Experimental results of two instances validated the superiority of the BDEPM algorithm.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2014年第4期484-488,共5页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(61273155)
关键词
无参数变异
二进制编码
差分进化
0—1背包问题
二次贪婪变换
parameterless mutation
binary code
differential evolution
0-1 knapsack problem
quadratic greedy transform
作者简介
孔祥勇（1988-），男，山东滕州人．东北大学博士研究生；
高立群（1949-）．男，辽宁沈阳人．东北大学教授，博士生导师．
