.png){kind=icon}
返回
A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2013.04.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel binary fruit fly optimization algorithm (bFOA) is proposed to solve the multidimensional knapsack problem (MKP). In the bFOA, binary string is used to represent the solution of the MKP, and three main search processes are designed to perform evolutionary search, including smell-based search process, local vision-based search process and global vision-based search process. In particular, a group generating probability vector is designed for producing new solutions. To enhance the exploration ability, a global vision mechanism based on differential information among fruit flies is proposed to update the probability vector. Meanwhile, two repair operators are employed to guarantee the feasibility of solutions. The influence of the parameter setting is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on benchmark instances are provided. And the comparisons to the existing algorithms demonstrate the effectiveness of the proposed bFOA in solving the MKP, especially for the large-scale problems. (c) 2013 Elsevier B.V. All rights reserved.
Keyword:
Multidimensional knapsack problem
Fruit fly optimization algorithm
Binary algorithm
Smell-based search
Vision-based search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Operando mechanistic studies of selective oxidation of glycerol to dihydroxyacetone over amorphous cobalt oxide在无定形氧化钴上甘油选择性氧化为二羟基丙酮的机理研究
PREAI
分享收藏
A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example一种新的果蝇优化算法 -- 以财务困境模型为例
PREAI
分享收藏分享收藏
查看更多内容