.png){kind=icon}
返回
Solving 0-1 knapsack problems based on amoeboid organism algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.04.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid organism model, the longest path problem is transformed into the shortest path problem. Finally, the shortest path problem can be well handled by the amoeboid organism algorithm. Numerical examples are given to illustrate the efficiency of the proposed model. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
0-1 Knapsack problem
Bio-inspired algorithm
Network converting algorithm
Optimization
Shortest path problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
IFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets
PREAI
分享收藏
分享收藏
查看更多内容