| 基于动态规划的生产库存问题的改进算法 |
| |
| 引用本文： | 丁国星 刘飞 刘科 于洪. 基于动态规划的生产库存问题的改进算法[J]. 重庆邮电学院学报(自然科学版), 2006, 18(3): 413-415 |
| |
| 作者姓名： | 丁国星 刘飞 刘科 于洪 |
| |
| 作者单位： | 重庆邮电大学计算机科学与技术学院,重庆400065 |
| |
| 基金项目： | 重庆市教委科学技术研究项目（050302） |
| |
| 摘 要： | 在深入分析了生产库存问题之后,应用线性代数理论对可能的生产情况进行分析,得到了新的结论.然后结合动态规划的基本原理,改进了算法的步长,从而得到了求解该问题的优化的动态规划算法.
|
| 关 键 词： | 生产库存问题 动态规划 线性代数 |
| 文章编号： | 1004-5694（2006）03-0413-03 |
| 收稿时间： | 2005-08-25 |
| 修稿时间： | 2005-12-05 |
Improved produce-storage problem algorithm based on dynamic programming |
| |
| DING Guo-xing,LIU fei, LIU Ke, YU Hong. Improved produce-storage problem algorithm based on dynamic programming[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition), 2006, 18(3): 413-415 |
| |
| Authors: | DING Guo-xing LIU fei LIU Ke YU Hong |
| |
| Affiliation: | College of Computer Science and Technology ,Chongqing University of Posts and Telecommunication, Chongqing 400065, P. R. China |
| |
| Abstract: | In this paper, the produce-storage problem is discussed, and a theorem is proposed based on linear algebraic theory. Then a new algorithm based on dynamic programming is proposed through improving the step-length. Finally, the complexity of the algorithm is analyzed. |
| |
| Keywords: | produce-storage problem dynamic programming linear algebraic |
| 本文献已被 CNKI 维普 等数据库收录！ |
