Enhancing transportation network capacity by congestion pricing with simultaneous toll location and toll level optimization

2012 ◽  
Vol 44 (4) ◽  
pp. 477-488 ◽  
Author(s):  
Xiaoning Zhang ◽  
Bert van Wee
Keyword(s):  
Transportation Network ◽  
Congestion Pricing ◽  
Network Capacity

scholarly journals Estimating the Capacity of Urban Transportation Networks with an Improved Sensitivity Based Method

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Muqing Du ◽  
Xiaowei Jiang ◽  
Lin Cheng
Keyword(s):  
Sensitivity Analysis ◽  
Large Scale ◽  
Transportation Network ◽  
Network Capacity ◽  
Combined Model ◽  
Practical Applications ◽  
Large Scale Problems ◽  
Capacity Model ◽  
High Efficient ◽  
Equilibrium Constraint

The throughput of a given transportation network is always of interest to the traffic administrative department, so as to evaluate the benefit of the transportation construction or expansion project before its implementation. The model of the transportation network capacity formulated as a mathematic programming with equilibrium constraint (MPEC) well defines this problem. For practical applications, a modified sensitivity analysis based (SAB) method is developed to estimate the solution of this bilevel model. The high-efficient origin-based (OB) algorithm is extended for the precise solution of the combined model which is integrated in the network capacity model. The sensitivity analysis approach is also modified to simplify the inversion of the Jacobian matrix in large-scale problems. The solution produced in every iteration of SAB is restrained to be feasible to guarantee the success of the heuristic search. From the numerical experiments, the accuracy of the derivatives for the linear approximation could significantly affect the converging of the SAB method. The results also show that the proposed method could obtain good suboptimal solutions from different starting points in the test examples.

scholarly journals Research on Congestion Pricing in Multimode Traffic considering Delay and Emission

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Hongna Dai ◽  
Enjian Yao ◽  
Rui Zhao
Keyword(s):  
Bilevel Programming ◽  
Traffic Congestion ◽  
Transportation Network ◽  
Rapid Development ◽  
Congestion Pricing ◽  
Urban Traffic ◽  
Pricing Model ◽  
Network Efficiency ◽  
Traffic Demand ◽  
Model Based

Rapid development of urbanization and automation has resulted in serious urban traffic congestion and air pollution problems in many Chinese cities recently. As a traffic demand management strategy, congestion pricing is acknowledged to be effective in alleviating the traffic congestion and improving the efficiency of traffic system. This paper proposes an urban traffic congestion pricing model based on the consideration of transportation network efficiency and environment effects. First, the congestion pricing problem under multimode (i.e., car mode and bus mode) urban traffic network condition is investigated. Second, a traffic congestion pricing model based on bilevel programming is formulated for a dual-mode urban transportation network, in which the delay and emission of vehicles are considered. Third, an improved mathematical algorithm combining successive average method with the genetic algorithm is proposed to solve the bilevel programming problem. Finally, a numerical experiment based on a hypothetical network is performed to validate the proposed congestion pricing model and algorithm.

scholarly journals Megaregional Passenger Transportation Hub Location Problem Considering Congestion Effects

2021 ◽  
Vol 33 (4) ◽  
pp. 551-563
Author(s):  
Huang Yan ◽  
Xiaoning Zhang
Keyword(s):  
Location Problem ◽  
Travel Demand ◽  
Programming Model ◽  
Transportation Network ◽  
Network Capacity ◽  
Mixed Integer ◽  
Hub Location ◽  
Hub Location Problem ◽  
Passenger Transportation ◽  
Congestion Effects

The need to make effective plans for locating transportation hubs is of increasing importance in the megaregional area, as recent research suggests that the growing intercity travel demand affects the efficiency of a megaregional transportation system. This paper investigates a hierarchical facility location problem in a megaregional passenger transportation network. The aim of the study is to determine the locations of hub facilities at different hierarchical levels and distribute the demands to these facilities with minimum total cost, including investment, transportation, and congestion costs. The problem is formulated as a mixed-integer nonlinear programming model considering the service availability structure and hub congestion effects. A case study is designed to demonstrate the effectiveness of the proposed model in the Wuhan metropolitan area. The results show that the congestion effects can be addressed by reallocating the demand to balance the hub utilisation or constructing new hubs to increase the network capacity. The methods of appropriately locating hubs and distributing traffic flows are proposed to optimise the megaregional passenger transportation networks, which has important implications for decision makers.

scholarly journals Where to cut to delay a pandemic with minimum disruption? mathematical analysis based on the SIS model

2021 ◽  
pp. 1-26
Author(s):  
Paolo Bartesaghi ◽  
Ernesto Estrada
Keyword(s):  
Upper Bound ◽  
Time Delays ◽  
Transportation Network ◽  
Network Capacity ◽  
Sis Model ◽  
Transportation Capacity ◽  
Epidemic Dynamic ◽  
Dynamic Relations ◽  
The Uk ◽  
Communicability Function

We consider the problem of modifying a network topology in such a way as to delay the propagation of a disease with minimal disruption of the network capacity to reroute goods/items/passengers. We find an approximate solution to the Susceptible-Infected-Susceptible (SIS) model, which constitutes an upper bound to its exact solution. This upper bound allows direct structure-epidemic dynamic relations via the total communicability function. Using this approach we propose a strategy to remove edges in a network that significantly delays the propagation of a disease across the network with minimal disruption of its capacity to deliver goods/items/passengers. We apply this strategy to the analysis of the UK airport transportation network weighted by the number of passengers transported in 2003. We find that the removal of all flights connecting four origin-destination pairs in the UK delays the propagation of a disease by more than 300%, with a minimal deterioration of the transportation capacity of this network. These time delays in the propagation of a disease represent an important non-pharmaceutical intervention to confront an epidemic, allowing for better preparations of the health systems, while keeping the economy moving with minimal disruptions.

Definition and Evaluation Modeling of Transportation Network Layout Adaptability

2011 ◽  
Vol 71-78 ◽  
pp. 3938-3941 ◽  
Author(s):  
Jie Gao ◽  
Mei Xiang Wu ◽  
Chen Qiang Yin
Keyword(s):  
Heuristic Algorithm ◽  
Coefficient Of Variation ◽  
Large Scale ◽  
Transportation Networks ◽  
Transportation Network ◽  
Optimization Methods ◽  
Network Capacity ◽  
Network Layout ◽  
Proposed Model ◽  
Coordination Degree

According to the reliability theories and the characteristics of transportation networks, the layout adaptability is defined as the coupling and coordination degree of transportation network capacity and demand firstly. Then a layout adaptability model is built adopting the optimization methods, degree of layout adaptability index and coefficient of variation are used to evaluate the adaptability of scale and distribution respectively. Meanwhile, the heuristic algorithm suitable for large scale is designed to solve the proposed model. At last, a numerical example and its results are provided to demonstrate the validity of the proposed model and algorithm.

scholarly journals Maritime Freight Data Collection Systems and Database to Support Performance Measures and Market Analyses

2020 ◽  
Author(s):  
P.S. Sriraj ◽  
◽  
Bo Zou ◽  
Lise Dirks ◽  
Nahid Parvez Farazi ◽  
...  
Keyword(s):  
Performance Measurement ◽  
Transportation Network ◽  
Network Capacity ◽  
The United States ◽  
The State ◽  
Army Corps ◽  
Army Corps Of Engineers ◽  
Inland Waterways ◽  
Us Army ◽  
The People

The Illinois Marine Transportation System (IMTS) is a key component of the nation’s inland waterway system. IMTS is comprised of 27 locks and dams, 19 port districts, more than 350 active terminals, and 1,118 miles of navigable inland waterways traversing along the borderline or within the state of Illinois. However, the infrastructure of IMTS is aging and its conditions are deteriorating. To monitor the performance of IMTS and guide infrastructure investment to enhance safety, efficiency, and reliability of the system, a comprehensive performance measurement program is needed. To this end, the objective of this project is to create an integrated, comprehensive, and maintainable database that facilitates performance measurement of maritime freight to, from, and through Illinois. To achieve this objective, a review of the literature on maritime freight transportation both in the United States and abroad was performed. To gauge practitioners’ points of view, a series of phone interviews and online surveys of Illinois’ neighboring state DOT officials, officials from the US Army Corps of Engineers, Illinois port district authorities, and carriers operating in Illinois was also conducted. With the findings from the literature review and an understanding of state DOT practices, the needed and available data sources for a maritime freight performance measurement program were identified. Building on all the above efforts, a first-of-its-kind PM database for IMTS was designed and developed, along with a detailed user manual, ready for IDOT’s immediate use and future updates. In addition, opportunities for IDOT to use the database to conduct analysis are discussed. Key programmatic recommendations that outline the role of IDOT as a champion and as a facilitator are further included. The outcome of this project will help IDOT gain much-needed knowledge of and develop programs to improve IMTS performance, increase multimodal transportation network capacity, and expand the transportation and logistics sector of the state, which ultimately benefit the people and economy of Illinois.

scholarly journals Modeling the α-max capacity of transportation networks: a single-level mathematical programming formulation

2021 ◽  
Author(s):  
Zhaoqi Zang ◽  
Xiangdong Xu ◽  
Anthony Chen ◽  
Chao Yang
Keyword(s):  
Mathematical Programming ◽  
Travel Time ◽  
Large Scale ◽  
Transportation Network ◽  
Network Capacity ◽  
Solution Algorithm ◽  
Single Level ◽  
Capacity Model ◽  
Proposed Model ◽  
The Impact

AbstractNetwork capacity, defined as the largest sum of origin–destination (O–D) flows that can be accommodated by the network based on link performance function and traffic equilibrium assignment, is a critical indicator of network-wide performance assessment in transportation planning and management. The typical modeling rationale of estimating network capacity is to formulate it as a mathematical programming (MP), and there are two main approaches: single-level MP formulation and bi-level programming (BLP) formulation. Although single-level MP is readily solvable, it treats the transportation network as a physical network without considering level of service (LOS). Albeit BLP explicitly models the capacity and link LOS, solving BLP in large-scale networks is challenging due to its non-convexity. Moreover, the inconsideration of trip LOS makes the existing models difficult to differentiate network capacity under various traffic states and to capture the impact of emerging trip-oriented technologies. Therefore, this paper proposes the α-max capacity model to estimate the maximum network capacity under trip or O–D LOS requirement α. The proposed model improves the existing models on three aspects: (a) it considers trip LOS, which can flexibly estimate the network capacity ranging from zero to the physical capacity including reserve, practical and ultimate capacities; (b) trip LOS can intuitively reflect users’ maximum acceptable O–D travel time or planners’ requirement of O–D travel time; and (c) it is a convex and tractable single-level MP. For practical use, we develop a modified gradient projection solution algorithm with soft constraint technique, and provide methods to obtain discrete trip LOS and network capacity under representative traffic states. Numerical examples are presented to demonstrate the features of the proposed model as well as the solution algorithm.

scholarly journals Robust Evaluation for Transportation Network Capacity under Demand Uncertainty

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Muqing Du ◽  
Xiaowei Jiang ◽  
Lin Cheng ◽  
Changjiang Zheng
Keyword(s):  
Demand Uncertainty ◽  
Travel Demand ◽  
Transportation Networks ◽  
Transportation Network ◽  
Network Capacity ◽  
Traffic Jam ◽  
Reserve Network ◽  
Bounded Set ◽  
Robust Model ◽  
And Performance

As more and more cities in worldwide are facing the problems of traffic jam, governments have been concerned about how to design transportation networks with adequate capacity to accommodate travel demands. To evaluate the capacity of a transportation system, the prescribed origin and destination (O-D) matrix for existing travel demand has been noticed to have a significant effect on the results of network capacity models. However, the exact data of the existing O-D demand are usually hard to be obtained in practice. Considering the fluctuation of the real travel demand in transportation networks, the existing travel demand is represented as uncertain parameters which are defined within a bounded set. Thus, a robust reserve network capacity (RRNC) model using min–max optimization is formulated based on the demand uncertainty. An effective heuristic approach utilizing cutting plane method and sensitivity analysis is proposed for the solution of the RRNC problem. Computational experiments and simulations are implemented to demonstrate the validity and performance of the proposed robust model. According to simulation experiments, it is showed that the link flow pattern from the robust solutions to network capacity problems can reveal the probability of high congestion for each link.

Sign in / Sign up

Export Citation Format

Share Document