| 基于熵的瓶颈运输问题的动态规划解 |
| |
| 引用本文： | 岳中亮,由雷.基于熵的瓶颈运输问题的动态规划解[J].广东海洋大学学报,2006,26(6):46-49. |
| |
| 作者姓名： | 岳中亮 由雷 |
| |
| 作者单位： | 广东海洋大学,理学院,广东,湛江,524025 |
| |
| 摘 要： | 建立了关于时间(路程)的瓶颈运输问题的动态规划模型,并利用熵作为工具,解决了物品运输过程中所用时间长短的界问题,进而给出易于处理的瓶颈运输问题的动态规划模型。最后给出一个实例说明该方法的实用性和有效性。
|
| 关 键 词： | 瓶颈运输问题 动态规划 熵 最优解 |
| 文章编号： | 1007-7995(2006)06-0046-04 |
| 修稿时间： | 2006年3月16日 |
Dynamic Programming Algorithm of Bottleneck Transportation Problem Based on Entropy |
| |
| YUE Zhong-liang,YOU Lei.Dynamic Programming Algorithm of Bottleneck Transportation Problem Based on Entropy[J].Journal of Zhanjiang Ocean University,2006,26(6):46-49. |
| |
| Authors: | YUE Zhong-liang YOU Lei |
| |
| Abstract: | A new dynamic programming model is presented on the time(distance) for bottleneck transportation problem in this paper,and the critical bound which be induced by entropy can be calculated.In addition,a simplified model that can be solved easily is given.At last,the method illustrated by a given example. |
| |
| Keywords: | bottleneck transportation dynamic programming entropy optimal solution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
