In a given directed logistics transportation network with only one source node and one sink node,every arc has capacity to be improved to a given level and there is time limitation between source node and sink node,how to appropriately expand the network and shorten the transportation time to reduce the difference between network benefit and expected benefit to the largest extend.

Vehicular transport network optimization model based on relational matrices searching for routes;

Application of Dijkstra algorithm in enterprise s logistic transport network;

Time-dependent Minimum Cost Path Modal and Algorithm of Transport Network

The Study of the Shortest Paths in Transportation Network Under Time Constraint;

Study on transportation network optimization about transportation decision-making for logistic delivery;

Petri net simulation algorithm of maximum flow in transportation network;

An algorithm with polynomial complexity O(n 3) is produced in this article,for seeking the maximum capacity paths between arbitrary two nodes in the transportation network.

Authors produce an algorithm for seeking the maximum Capacity Paths from the specified node to all other nodes in the transportation network,which has polynomial complexity O(n 2).