本文已被：浏览 1895次 下载 1703次
Received:August 08, 2018 Revised:August 30, 2018
Received:August 08, 2018 Revised:August 30, 2018
中文摘要: 为了克服现有方法在求解0-1背包问题时存在的缺陷，提出了一种改进的烟花算法.在给出0-1背包问题的数学模型后，利用Kent混沌映射对基本烟花算法的解初始化以使初始位置分布更加均匀，同时引入Sigmoid函数得到渐变的爆炸半径使得算法的求解精度与搜索速度达到某种平衡，用改进的烟花算法来对其进行求解.通过对典型测试函数和0-1背包问题的求解结果说明了所提出的改进烟花算法求解精度更高，性能更加稳定.
Abstract:To overcome the shortcomings of the existing method in solving the 0-1 knapsack problems, an improved fireworks algorithm is proposed. After a mathematical model of the 0-1 knapsack problem is given, an improved fireworks algorithm is proposed to solve it. The main idea of the improved algorithm is as follows. The initialization of the basic fireworks algorithm is solved by using Kent chaotic map to make the initial position more uniform. The Sigmoid function is also introduced to get the gradual explosion radius to make the solution accurate and the search speed reach a certain balance. The resolving results of the typical test function and the 0-1 knapsack problem show that the improved fireworks algorithm has higher precision and more stable performance.
keywords: 0-1 knapsack problem optimization fireworks algorithm chaotic mapping gradual explosion radius
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金（61773016）；陕西省自然科学基础研究计划（2014JM8325）；陕西省教育厅专项科研计划（14JK1538）；西安理工大学科技创新计划（2016CX013）
引用文本：
徐小平,庞润娟,王峰,钱富才.求解0-1背包问题的烟花算法.计算机系统应用,2019,28(2):164-170
XU Xiao-Ping,PANG Run-Juan,WANG Feng,QIAN Fu-Cai.Fireworks Algorithm for Solving 0-1 Knapsack Problems.COMPUTER SYSTEMS APPLICATIONS,2019,28(2):164-170
徐小平,庞润娟,王峰,钱富才.求解0-1背包问题的烟花算法.计算机系统应用,2019,28(2):164-170
XU Xiao-Ping,PANG Run-Juan,WANG Feng,QIAN Fu-Cai.Fireworks Algorithm for Solving 0-1 Knapsack Problems.COMPUTER SYSTEMS APPLICATIONS,2019,28(2):164-170
