The Time Flow Problem On Capacity-Time Network

In this paper, we mostly consider the problem finding minimum time flow about military affair furnishment material accommodate, in which a given amount of flow needs to be sent, in minimum travel time from an origin node to a destination node while the flows on used links do not exceed their capacities. Many factors need be considered when we study this problem. Firstly, How do we search optimal solution of network with respect to various constraints, i.e. distance, time and cost. Secondly Traditional solution algorithms may impose an unacceptable long computational time when applied to realistic road networks. It is need to simplify solution algorithms of problems, thereby save calculate time by network knowledge, we discuss five ways about minimum time flow problem, and develop some specialized efficient algorithms to solve the problems.we discuss the minimum time flow problem on capacity-time network and the maximum flow problem in limited time on capacity-time network, we put forward concept of time about networks, respectively present a formulation and develop two efficient solution algorithm, we also consider the minimum time flow problem on capacity-time network with jam, we describe mathematics model, process detailed theory analyses and provide an algorithms, we import Analytic Hierarchy Process into optimization theory, band organically together quantitative analyses with qualitative analyses, solve Multiobjective optimal choice of transportation network. In the end of this paper, we analyses some properties of dynamic networks, give an efficient solution algorithms, and illustrate the algorithms by a numerical example.