SIA OpenIR  > 信息服务与智能控制技术研究室
Binary artificial bee colony algorithm for solving 0-1 knapsack problem
Liu W(刘微); Niu B(牛奔); Chen HN(陈瀚宁)
作者部门信息服务与智能控制技术研究室
关键词Artificial Intelligence Combinatorial Optimization Multiobjective Optimization Particle Swarm Optimization (Pso)
发表期刊Advances in Information Sciences and Service Sciences
ISSN1976-3700
2012
卷号4期号:22页码:464-470
收录类别EI
EI收录号20125215835488
产权排序1
摘要 In this paper, a binary artificial bee colony (BABC) algorithm is proposed to solve the 0-1 Knapsack problem. Unlike the original ABC algorithm, the proposed BABC represents a food source as a discrete binary variable and applies discrete operators to change the foraging trajectories of the employed bees, onlookers and scouts in the probability that a coordinate will take on a zero or one value. To verify the performance of the proposed algorithms, we made a comparison between algorithms of the proposed BABC with the standard binary particle swarm optimizer (BPSO) and the genetic algorithm (BGA). The comparison results showed that the proposed algorithms outperform the BPSO and BGA in terms of quality of solution found.
语种英语
文献类型期刊论文
条目标识符http://ir.sia.cn/handle/173321/10581
专题信息服务与智能控制技术研究室
作者单位1.Jilin Normal University, Siping, 136000, China
2.Laboratory of Information Service and Intelligent Control, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
3.College of Management, Shenzhen University, Shenzhen, 518060, China
推荐引用方式
GB/T 7714
Liu W,Niu B,Chen HN. Binary artificial bee colony algorithm for solving 0-1 knapsack problem[J]. Advances in Information Sciences and Service Sciences,2012,4(22):464-470.
APA Liu W,Niu B,&Chen HN.(2012).Binary artificial bee colony algorithm for solving 0-1 knapsack problem.Advances in Information Sciences and Service Sciences,4(22),464-470.
MLA Liu W,et al."Binary artificial bee colony algorithm for solving 0-1 knapsack problem".Advances in Information Sciences and Service Sciences 4.22(2012):464-470.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Binary artificial be(735KB) 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liu W(刘微)]的文章
[Niu B(牛奔)]的文章
[Chen HN(陈瀚宁)]的文章
百度学术
百度学术中相似的文章
[Liu W(刘微)]的文章
[Niu B(牛奔)]的文章
[Chen HN(陈瀚宁)]的文章
必应学术
必应学术中相似的文章
[Liu W(刘微)]的文章
[Niu B(牛奔)]的文章
[Chen HN(陈瀚宁)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Binary artificial bee colony algorithm for solving 0-1 knapsack problem.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。