摘要
提出一种求解0—1背包问题的改进差异演化算法。首先对差异演化算法的选择操作进行修改,得到的改进差异演化算法可以直接有效地处理约束优化问题。其次,利用一种新的区间编码映射机制,将差异演化算法扩展到求解离散领域优化问题。仿真实验结果表明,与其他进化算法相比,改进差异演化算法求解经典背包问题时,求解精度高,收敛速度快,是求解经典背包问题的一种高效算法。
An improved differential evolution algorithm was proposed to solve the classical knapsack problem.The selection operation in original differential evolution was adapted to deal with constraints directly.Using a new range encoding mapping,the differential evolution algorithm can be used to deal with discrete optimization problem.The simulation results of the improved differential evolution algorithm show,compared with other evolution algorithm,the improved differential evolution is effective in solving 0-1 Knapsack Problems.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第32期12-14,18,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No．70771037)。
关键词
背包问题
差异演化
区间编码映射
选择操作
knapsack problem
differential evolution
range encoding mapping
selection operation
