.png){kind=icon}
返回
A new ant colony optimization algorithm for the multidimensional Knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.12.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper proposes a new ant colony optimization (ACO) approach, called binary ant system (BAS), to multidimensional Knapsack problem (MKP). Different from other ACO-based algorithms applied to MKP, BAS uses a pheromone laying method specially designed for the binary solution structure, and allows the generation of infeasible solutions in the solution construction procedure. A problem specific repair operator is incorporated to repair the infeasible solutions generated in every iteration. Pheromone update rule is designed in such a way that pheromone on the paths can be directly regarded as selecting probability. To avoid premature convergence, the pheromone re-initialization and different pheromone intensification strategy depending on the convergence status of the algorithm are incorporated. Experimental results show the advantages of BAS over other ACO-based approaches for the benchmark problems selected from OR library. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
ant colony optimization
binary ant system
combinatorial optimization
multidimensional Knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Crystal Chemistry and Structural Complexity of the Uranyl Carbonate Minerals and Synthetic Compounds.png)
Crystals
OAAI
CrystalsIF0
OAAI分享收藏
没有更多内容
没有更多内容