Institute of Computing Technology, Chinese Academy IR
An improved monkey algorithm for a 0-1 knapsack problem | |
Zhou, Yongquan1; Chen, Xin1,2; Zhou, Guo3 | |
2016 | |
发表期刊 | APPLIED SOFT COMPUTING |
ISSN | 1568-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 |
DOI | 10.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 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | 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. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论