Macroscopic Fundamental Diagram Based Discrete Transportation Network Design. (20th January 2020)

• Record Type: Journal Article
• Authors: Hu, Guojing; Lu, Weike; Wang, Feng; Whalin, Robert W.
• Other Names: Lee Jaeyoung Academic Editor.
• Is Part Of: Journal of advanced transportation. Volume 2020(2020)
• Publication Date: 2020-01-20
• Subjects: Transportation -- Periodicals; 388.05
• DOI: 10.1155/2020/4951953
• Languages: English
• ISSNs: 0197-6729

Abstract

Abstract : The presence of demand uncertainty brings challenges to network design problems (NDP), because fluctuations in origin-destination (OD) demand have a prominent effect on the corresponding total travel time, which is usually adopted as an index to evaluate the network design problem. Fortunately, the macroscopic fundamental diagram (MFD) has been proved to be a property of the road network itself, independent of the origin-destination demand. Such characteristics of an MFD provide a new theoretical basis to assess the traffic network performance and further appraise the quality of network design strategies. Focusing on improving network capacity under the NDP framework, this paper formulates a bi-level programming model, where at the lower level, flows are assigned to the newly extended network subject to user equilibrium theory, and the upper level determines which links should be added to achieve the maximum network capacity. To solve the proposed model, we design an algorithm framework, where traffic flow distribution of each building strategy is calculated under the dynamic user equilibrium (DUE), and updated through the VISSIM-COM-Python interaction. Then, the output data are obtained to shape MFDs, and k -means clustering algorithm is employed to quantify the MFD-based network capacity. Finally, the methodology is implemented in a test network, and the results show the benefits of using the MFD-based method to solve the network design problem under stochastic OD demands. Specifically, the capacity paradox is also presented in the test results.