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

求解多选择背包问题的改进差分演化算法
引用本文:贺毅朝,寇应展,陈致明.求解多选择背包问题的改进差分演化算法[J].小型微型计算机系统,2007,28(9):1682-1685.
作者姓名:贺毅朝  寇应展  陈致明
作者单位:1. 石家庄经济学院,信息工程系,河北,石家庄,050031
2. 中国人民解放军,军械工程学院,计算机工程系,河北,石家庄,050003
摘    要:首先将差分演化算法(DEA)的演化机制归结为差异算子(DO)和选择算子(SO)的作用,然后基于离散域上的多选择背包问题(MCKP),通过重新定义DEA算法的差异算子中的三种基本运算,并采用个体正整数编码方法和处理非正常编码的快速微调策略,提出了一种求解MCKP问题的改进差分演化算法(MDEA),第一次将DEA用于求解组合最优化问题.对经典MCKP问题实例的计算表明:MDEA算法不但是可行的,而且是高效的.

关 键 词:差分演化算法  多选择背包问题  个体编码  差异算子
文章编号:1000-1220(2007)09-1682-04
修稿时间:2006-06-27

A Modified Differential Evolution Algorithm for Multiple-choice Knapsack Problem
HE Yi-chao,KOU Ying-zhan,CHEN Zhi-ming.A Modified Differential Evolution Algorithm for Multiple-choice Knapsack Problem[J].Mini-micro Systems,2007,28(9):1682-1685.
Authors:HE Yi-chao  KOU Ying-zhan  CHEN Zhi-ming
Affiliation:1.Information Project Department, Shijiazhuang University of Economics, Shijiazhuang 050031, China;2.Computer Engineering Department, Ordnance Engineering College, Shijiazhuang 050003, China
Abstract:In this paper, at first conclude the evolution mechanism of differential evolution algorithm (DEA) to the function of differential operator and select operator. Then, advanced a modified differential evolution algorithm (MDEA) for multiple-choice knapsack problem (MCKP) over discrete space, which use individual positive coding method and combine with the subtle adjusting strategy of non-normal coding through newly defining three basic operations of differential operator(DO) in DEA. First apply DEA to solve combinatorial optimization problems. Calculations of instances to classical MCKP show that MDEA is not only feasible, but also have a high efficiency.
Keywords:differential evolution algorithm  multiple-choice knapsack problem  individual coding  differential operator
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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