.png){kind=icon}
返回
An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.11.058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an effective hybrid algorithm based on estimation of distribution algorithm (EDA) is proposed to solve the multidimensional knapsack problem (MKP). With the framework of EDA, the probability model is built with the superior population and the new individuals are generated based on probability model. In addition, an updating mechanism of the probability model is proposed and a mechanism for initializing the probability model based on the specific knowledge of the MKP is also proposed to improve the convergence speed. Meanwhile, an adaptive local search is proposed to enhance the exploitation ability. Furthermore, the influences of parameters are investigated based on Taguchi method of design of experiment and the importance of repair operator is also studied via simulation testing and comparisons. Finally, numerical simulation is carried out based on the benchmark instances, and the comparisons with some existing algorithms demonstrate the effectiveness of the proposed algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Multidimensional knapsack problem
Estimation of distribution algorithm
Probability model
Hybrid algorithm
Design of experiment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
Rapid transient expression of functional human vascular endothelial growth factor in Nicotiana benthamiana and characterization of its biological activity功能性人血管内皮生长因子在本氏烟草中的快速瞬时表达及其生物学活性
OAAI
OAAI分享收藏
A new ant colony optimization algorithm for the multidimensional Knapsack problem求解多维背包问题的一种新的蚁群优化算法
PREAI
分享收藏 没有更多内容
没有更多内容