摘要
针对同时带有弧费用和弧时间的运输网络中最少时间最小费用路的问题,本文提出了一种算法。该算法能高效地求出此类网络中从源节点到目的节点的双目标最短路(最少时间最小费用路)。实例计算表明,该算法是有效的。
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.
出处
《计算机工程与科学》
CSCD
2008年第7期77-78,89,共3页
Computer Engineering & Science
基金
陕西省自然科学基础研究计划项目(2006A12)
宝鸡文理学院院级科研项目(Zk0693)
关键词
最少时间最小费用路
运输网络
算法
minimal cost path with minimal time
transportation network
algorithm
