| 一种求解最少时间最小费用路问题的算法 |
| |
| 引用本文： | 孙小军,焦建民.一种求解最少时间最小费用路问题的算法[J].计算机工程与科学,2008,30(7):77-78. |
| |
| 作者姓名： | 孙小军 焦建民 |
| |
| 作者单位： | 宝鸡文理学院数学系,陕西,宝鸡,721013 |
| |
| 基金项目： | 陕西省自然科学基金
,
宝鸡文理学院校科研和教改项目 |
| |
| 摘 要： | 针对同时带有弧费用和弧时间的运输网络中最少时间最小费用路的问题，本文提出了一种算法。该算法能高效地求出此类网络中从源节点到目的节点的双目标最短路（最少时间最小费用路）。实例计算表明，该算法是有效的。
|
| 关 键 词： | 最少时间最小费用路 运输网络 算法 |
An Algorithm for the Problem of Finding the Minimal-Cost Path with the Minimal Time |
| |
| SUN Xiao-jun,JIAO Jian-min.An Algorithm for the Problem of Finding the Minimal-Cost Path with the Minimal Time[J].Computer Engineering & Science,2008,30(7):77-78. |
| |
| Authors: | SUN Xiao-jun JIAO Jian-min |
| |
| Abstract: | As to the minimal-cost path problem with the minimal time in the transportation network which has both edge cost and edge time,an algorithm is put forward in this paper.The minimal cost path with the minimal time from the source node to all the object nodes can be derived quickly by using the algorithm.In the end,an example shows the effectiveness of the algorithm. |
| |
| Keywords: | minimal cost path with minimal time transportation network algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
