A Study on the Maximum Network Flow Using Degree of Satisfaction on Travel Time to Evaluate a Level of Road Service

1992 ◽  
Vol 27 (0) ◽  
pp. 265-270
Author(s):  
Jun-ichi Takayama ◽  
Hirokazu Hama
Author(s):  
Robert Tarjan ◽  
Julie Ward ◽  
Bin Zhang ◽  
Yunhong Zhou ◽  
Jia Mao

2015 ◽  
Vol 35 ◽  
pp. 9-16 ◽  
Author(s):  
Abdullah N. Arslan ◽  
Dan He ◽  
Yu He ◽  
Xindong Wu

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Ming-Chorng Hwang ◽  
Hsun-Jung Cho ◽  
You-Heng Huang

A theoretic formulation on how traffic time information distributed by ITS operations influences the trajectory of network flows is presented in this paper. The interactions between users and ITS operator are decomposed into three parts: (i) travel time induced path flow dynamics (PFDTT); (ii) demand induced path flow dynamics (PFDD); and (iii) predicted travel time dynamics for an origin-destination (OD) pair (PTTDOD). PFDTT describes the collective results of user’s daily route selection by pairwise comparison of path travel time provided by ITS services. The other two components, PTTDOD and PFDD, are concentrated on the evolutions of system variables which are predicted and observed, respectively, by ITS operators to act as a benchmark in guiding the target system towards an expected status faster. In addition to the delivered modelings, the stability theorem of the equilibrium solution in the sense of Lyapunov stability is also provided. A Lyapunov function is developed and employed to the proof of stability theorem to show the asymptotic behavior of the aimed system. The information of network flow dynamics plays a key role in traffic control policy-making. The evaluation of ITS-based strategies will not be reasonable without a well-established modeling of network flow evolutions.


Author(s):  
Mohan Chandra Adhikari ◽  
Umila Pyakurel

The aim of the maximum network flow problem is to push as much flow as possible between two special vertices, the source and the sink satisfying the capacity constraints. For the solution of the maximum flow problem, there exists a number of algorithms. The existing algorithms can be divided into two families. First, augmenting path algorithms that satisfy the conservation constraints at intermediate vertices and the second preflow push relabel algorithms that violates the conservation constraints at the intermediate vertices resulting incoming flow more than outgoing flow.In this paper, we study different algorithms that determine the maximum flow in the static and dynamic networks.


Sign in / Sign up

Export Citation Format

Share Document