.png){kind=icon}
返回
Solving 0-1 knapsack problem by a novel global harmony search algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.07.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0-1 knapsack problems. The proposed algorithm includes two important operations: position updating and genetic mutation with a small probability. The former enables the worst harmony of harmony memory to move to the global best harmony rapidly in each iteration, and the latter can effectively prevent the NGHS from trapping into the local optimum. Computational experiments with a set of large-scale instances show that the NGHS can be an efficient alternative for solving 0-1 knapsack problems. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Novel global harmony search algorithm 0-1 knapsack problems
Position updating
Genetic mutation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
.png){kind=icon}
PREAI
分享收藏分享收藏分享收藏 没有更多内容
没有更多内容