| 一种求解背包问题的新的神经网络模型 |
| |
| 引用本文： | 汪泽焱,李宁.一种求解背包问题的新的神经网络模型[J].解放军理工大学学报,2001,2(5):41-44. |
| |
| 作者姓名： | 汪泽焱 李宁 |
| |
| 作者单位： | 解放军理工大学理学院 江苏南京211101
(汪泽焱)，解放军理工大学理学院 江苏南京211101(李宁) |
| |
| 摘 要： | 背包问题是一类经典的组合优化问题，在网络资源分配中有着广泛的运用。人工神经网络已成为求解大规模优化问题的一种有效方法，已经证明了合适的神经网络能实时地得到问题的精确解。研究了背包问题的神经网络解法，给出了一种求解背包问题的新的神经网络模型，并证明了该网络模型收敛到背包问题的最优解。算例说明了模型有效性和准确性。
|
| 关 键 词： | 背包问题 神经网络模型 能量函数 组合优化问题 网络资源分配 最优解 |
| 文章编号： | 1009-3443(2001)05-0041-04 |
| 修稿时间： | 2001年2月22日 |
A New ANN of Solving Knap Problem |
| |
| WANG Ze-yan and LI Ning.A New ANN of Solving Knap Problem[J].Journal of PLA University of Science and Technology(Natural Science Edition),2001,2(5):41-44. |
| |
| Authors: | WANG Ze-yan and LI Ning |
| |
| Institution: | Institute of Sciences, PLA Univ. of Sci. & Tech., Nanjing 211101, China;Institute of Sciences, PLA Univ. of Sci. & Tech., Nanjing 211101, China |
| |
| Abstract: | The knap problem is a classical combinatorial optimization problem which plays an important role in a network source assignment. Artificial neural network (ANN) has been an effective method to solve the large-scale optimal problem. It's proved that the neural network can get the exact solutions to the problem if it is tuned appropriately. In this paper, the artificial neural network for the knap problem is explored. A new neural network to solve knap problem is presented. The proposed neural network is proved to be completely stable to the exact solutions. The simulation examples show its efficiency and the validity in finding the optimum solution to knap problem. |
| |
| Keywords: | knap problem artificial neural network energy function combinatorial optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《解放军理工大学学报》浏览原始摘要信息 |
| 点击此处可从《解放军理工大学学报》下载免费的PDF全文 |
