| 求解0-1背包问题的烟花算法 |
| |
| 引用本文： | 徐小平,庞润娟,王峰,钱富才.求解0-1背包问题的烟花算法[J].计算机系统应用,2019,28(2):164-170. |
| |
| 作者姓名： | 徐小平 庞润娟 王峰 钱富才 |
| |
| 作者单位： | 西安理工大学理学院,西安,710054;西安交通大学数学与统计学院,西安,710049;西安理工大学自动化与信息工程学院,西安 710048;西安卫星测控中心宇航动力学国家重点实验室,西安 710043 |
| |
| 基金项目： | 国家自然科学基金（61773016）；陕西省自然科学基础研究计划（2014JM8325）；陕西省教育厅专项科研计划（14JK1538）；西安理工大学科技创新计划（2016CX013） |
| |
| 摘 要： | 为了克服现有方法在求解0-1背包问题时存在的缺陷，提出了一种改进的烟花算法.在给出0-1背包问题的数学模型后，利用Kent混沌映射对基本烟花算法的解初始化以使初始位置分布更加均匀，同时引入Sigmoid函数得到渐变的爆炸半径使得算法的求解精度与搜索速度达到某种平衡，用改进的烟花算法来对其进行求解.通过对典型测试函数和0-1背包问题的求解结果说明了所提出的改进烟花算法求解精度更高，性能更加稳定.
|
| 关 键 词： | 0-1背包问题 优化 烟花算法 混沌映射 渐变爆炸半径 |
| 收稿时间： | 2018/8/8 0:00:00 |
| 修稿时间： | 2018/8/30 0:00:00 |
Fireworks Algorithm for Solving 0-1 Knapsack Problems |
| |
| XU Xiao-Ping,PANG Run-Juan,WANG Feng and QIAN Fu-Cai.Fireworks Algorithm for Solving 0-1 Knapsack Problems[J].Computer Systems& Applications,2019,28(2):164-170. |
| |
| Authors: | XU Xiao-Ping PANG Run-Juan WANG Feng and QIAN Fu-Cai |
| |
| Affiliation: | Faculty of Sciences, Xi''an University of Technology, Xi''an 710054, China,Faculty of Sciences, Xi''an University of Technology, Xi''an 710054, China,School of Mathematics and Statistics, Xi''an Jiaotong University, Xi''an 710049, China and Faculty of Automation and Information Engineering, Xi''an University of Technology, Xi''an 710048, China;State Key Laboratory of Astronautic Dynamics, Xi''an Satellite Control Center, Xi''an 710043, China |
| |
| 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 |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机系统应用》浏览原始摘要信息 |
|
点击此处可从《计算机系统应用》下载全文 |
|
