粒子群优化算法及其在背包问题中应用.docxVIP

PAGE \* MERGEFORMAT III 摘要 背包问题属于NP难问题，解决背包问题是解决组合优化所面临的问题之一，在现实中有着广泛的应用背景，而粒子群算法作为群智能算法而言，它通过追随当前搜索到的最优值来寻找全局最优。本文在对背包问题进行研究分析的基础上，采用基本粒子群算法、带惯性权重和带收缩因子的改进型粒子群算法来分别解决两个三十维和十维的0/1背包问题，通过多次试验，最终得出了所给的背包问题的最优解，与已知问题最优解一致。 关键词：粒子群优化算法，智能算法，背包问题，最优化 Abstract Knapsack problem is NP-hard problem to solve the knapsack problem solving combinatorial optimization problems faced by one of the wide range of applications in the real background, while the particle swarm algorithm as a swarm intelligence algorithm, by following the current search for the optimal.The value to find the global optimum. Based on the analysis of the knapsack problem, using the particle swarm algorithm with inertia weight and with a shrinkage factor improved particle swarm optimization to solve the two thirty-dimensional and eleven-dimensional 0/1 knapsack problem, through a multi-trials, and ultimately obtained the optimal solution to the knapsack problem with known optimal solution consistent. Keywords:?Particle swarm optimization?algorithm, ?the?intelligent algorithm, knapsack problem, optimization, 目录 TOC \t 一级标题,1,二级标题,2 1 绪论 PAGEREF _Toc327122056 \h 1 1.1 组合优化问题 PAGEREF _Toc327122057 \h 1 1.2 背包问题 PAGEREF _Toc327122058 \h 1 1.3 对背包问题的研究 PAGEREF _Toc327122059 \h 2 1.4 本文的结构 PAGEREF _Toc327122060 \h 4 2 优化算法和背包问题 PAGEREF _Toc327122061 \h 5 2.1 粒子群算法 PAGEREF _Toc327122062 \h 6 2.2 背包问题 PAGEREF _Toc327122063 \h 7 2.3 本章小结 PAGEREF _Toc327122064 \h 9 3 基本粒子群算法在背包问题中的应用 PAGEREF _Toc327122065 \h 10 3.1 基本粒子群算法 PAGEREF _Toc327122066 \h 10 3.2 基于基本粒子群算法的背包问题 PAGEREF _Toc327122067 \h 11 3.3 本章小结 PAGEREF _Toc327122068 \h 21 4 基于改进型粒子群算法的背包问题 PAGEREF _Toc327122069 \h 22 4.1 引入惯性权重与收缩因子的改进型粒子群算法 PAGEREF _Toc327122070 \h 22 4.2 基于改进型粒子群算法的背包问题 PAGEREF _Toc327122071 \h 24 4.3 本章小结 PAGEREF _Toc327122072 \h 28 5 总结与展望 PAGEREF _Toc327122073 \h 29 5.1 本文总结 PAGEREF _Toc327122074 \h 29 5.2 展望 PAGEREF _Toc327122075 \h 29 参考文献 PAGEREF _Toc327122077 \h 30 致谢 PAGEREF _Toc327122078 \h 32 粒子群优化算