CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
An improved monkey algorithm for a 0-1 knapsack problem
Zhou, Yongquan1; Chen, Xin1,2; Zhou, Guo3
2016
发表期刊APPLIED SOFT COMPUTING
ISSN1568-4946
卷号38页码:817-830
摘要The 0-1 knapsack problem is a classic combinational optimization problem. However, many exiting algorithms have low precision and easily fall into local optimal solutions to solve the 0-1 knapsack problem. In order to overcome these problems, this paper proposes a binary version of the monkey algorithm where the greedy algorithm is used to strengthen the local search ability, the somersault process is modified to avoid falling into local optimal solutions, and the cooperation process is adopted to speed up the convergence rate of the algorithm. To validate the efficiency of the proposed algorithm, experiments are carried out with various data instances of 0-1 knapsack problems and the results are compared with those of five metaheuristic algorithms. (C) 2015 Elsevier B.V. All rights reserved.
关键词Monkey algorithm Binary version of the monkey algorithm Knapsack problem Cooperation process Greedy strategy
DOI10.1016/j.asoc.2015.10.043
收录类别SCI
语种英语
资助项目National Science Foundation of China[61165015] ; National Science Foundation of China[61463007] ; National Science Foundation of China[61563008]
WOS研究方向Computer Science
WOS类目Computer Science, Artificial Intelligence ; Computer Science, Interdisciplinary Applications
WOS记录号WOS:000366805900058
出版者ELSEVIER SCIENCE BV
引用统计
被引频次:83[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/9074
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhou, Yongquan
作者单位1.Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Guangxi, Peoples R China
2.Dalian Univ Technol, Sch Software, Dalian 116024, Peoples R China
3.Chinese Acad Sci, Inst Comp Technol, Beijing 100081, Peoples R China
推荐引用方式
GB/T 7714
Zhou, Yongquan,Chen, Xin,Zhou, Guo. An improved monkey algorithm for a 0-1 knapsack problem[J]. APPLIED SOFT COMPUTING,2016,38:817-830.
APA Zhou, Yongquan,Chen, Xin,&Zhou, Guo.(2016).An improved monkey algorithm for a 0-1 knapsack problem.APPLIED SOFT COMPUTING,38,817-830.
MLA Zhou, Yongquan,et al."An improved monkey algorithm for a 0-1 knapsack problem".APPLIED SOFT COMPUTING 38(2016):817-830.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhou, Yongquan]的文章
[Chen, Xin]的文章
[Zhou, Guo]的文章
百度学术
百度学术中相似的文章
[Zhou, Yongquan]的文章
[Chen, Xin]的文章
[Zhou, Guo]的文章
必应学术
必应学术中相似的文章
[Zhou, Yongquan]的文章
[Chen, Xin]的文章
[Zhou, Guo]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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