中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 计算技术研究所
  3. 中国科学院计算技术研究所
  4. 中国科学院计算技术研究所期刊论文
  5. 英文
An improved monkey algorithm for a 0-1 knapsack problem

文献类型：期刊论文

作者Zhou, Yongquan1; Chen, Xin1,3; Zhou, Guo2
刊名APPLIED SOFT COMPUTING
出版日期2016
卷号38页码:817-830
关键词Monkey algorithm Binary version of the monkey algorithm Knapsack problem Cooperation process Greedy strategy
ISSN号1568-4946
DOI10.1016/j.asoc.2015.10.043
英文摘要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.
资助项目National Science Foundation of China[61165015] ; National Science Foundation of China[61463007] ; National Science Foundation of China[61563008]
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000366805900058
出版者ELSEVIER SCIENCE BV
源URL[http://119.78.100.204/handle/2XEOYT63/9073]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhou, Yongquan
作者单位1.Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Guangxi, Peoples R China
2.Chinese Acad Sci, Inst Comp Technol, Beijing 100081, Peoples R China
3.Dalian Univ Technol, Sch Software, Dalian 116024, 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.

入库方式： OAI收割

来源：计算技术研究所

浏览0
下载0
收藏0
其他版本

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