|
|||||
|
|
| 混合二进制差异演化算法解0-1背包问题 | |
| 引用本文： | 邓长寿,赵秉岩,梁昌勇. 混合二进制差异演化算法解0-1背包问题[J]. 计算机工程与设计, 2010, 31(8) |
| 作者姓名： | 邓长寿 赵秉岩 梁昌勇 |
| 作者单位： | 1. 九江学院,信息科学与技术学院,江西,九江,332005;合肥工业大学,网络系统研究所,安徽,合肥,230009 2. 九江学院商学院,江西,九江,332005 3. 合肥工业大学,网络系统研究所,安徽,合肥,230009 |
| 基金项目： | 国家自然科学基金，江西省教育厅科研基金 |
| 摘 要： | 为了有效求解0-1背包问题,提出一种混合二进制差异演化算法.该算法基于差异演化算法框架,采用二进制编码,通过增加映射操作、S型变换操作和逆映射操作等3种新的操作,将差异演化算法从实数优化领域推广至离散优化领域,成功解决了差异演化算法直接求解离散优化问题时的计算不封闭问题.此外,在每次迭代求解时,利用贪婪变换法对违反约束条件的不可行解进行变换,使其成为可行解.不同规模的背包问题的数值实验结果表明了该算法的有效性与适用性. |
| 关 键 词： | 0-1背包问题 二进制差异演化 映射操作 S型变换操作 逆映射操作 贪婪变换 |
Hybrid binary differential evolution algorithm for 0-1 knapsack problem |
|
| DENG Chang-shou,ZHAO Bing-yan,LIANG Chang-yong. Hybrid binary differential evolution algorithm for 0-1 knapsack problem[J]. Computer Engineering and Design, 2010, 31(8) | |
| Authors: | DENG Chang-shou ZHAO Bing-yan LIANG Chang-yong |
| Affiliation: | DENG Chang-shou1,3,ZHAO Bing-yan2,LIANG Chang-yong3 (1. School of Information Science , Technology,Jiujiang University,Jiujiang 332005,China,2. School of Business,3. Institute of Computer Network System,Hefei University of Technology,Hefei 230009,China) |
| Abstract: | In order to solve the 0-1 knapsack problem effectively, hybrid binary differential evolution algorithm is proposed. Firstly, the algorithm are added to the original differential evolution based on the original differential evolution with binary coding and three new operations which are mapping operation, S transform operation and inverse mapping operation, The three new operations extend the original differential evolution from the continuous field to discrete field by successfully solving the no closure pr... |
| Keywords: | 0-1 knapsack problem binary differential evolution mapping operation Stransform operation inverse mapping operation greedy transform |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |