.png){kind=icon}
返回
Solving randomized time-varying knapsack problems by a novel global firefly algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-017-0562-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel global firefly algorithm (GFA) is proposed for solving randomized time-varying knapsack problems (RTVKP). The RTVKP is an extension from the generalized time-varying knapsack problems (TVKP), by dynamically changing the profit and weight of items as well as the capacity of knapsack. In GFA, two-tuples which consists of real vector and binary vector is used to represent the individual in a population, and two principal search processes are developed: the current global best-based search process and the trust region-based search process. Moreover, a novel and effective two-stage repair operator is adopted to modify infeasible solutions and optimize feasible solutions as well. The performance of GFA is verified by comparison with five state-of-the-art classical algorithms over three RTVKP instances. The results indicate that the proposed GFA outperform the other five methods in most cases and that GFA is an efficient algorithm for solving randomized time-varying knapsack problems.
Keyword:
Firefly algorithm
Greedy optimization algorithm
Dynamic optimization
Knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.6K
被引数:
9.3K
机构
引用论文
.png){kind=icon}
Laser-Induced Breakdown Spectroscopy (LIBS) Analysis of Calcium Ions Dissolved in Water Using Filter Paper Substrates: An Ideal Internal Standard for Precision Improvement使用滤纸基底对溶解在水中的钙离子进行激光诱导击穿光谱 (LIBS) 分析: 提高精度的理想内标
PREAI
分享收藏分享收藏
查看更多内容