scholarly journals Time-dependent transportation network design that considers health cost

2014 ◽  
Vol 11 (1) ◽  
pp. 74-101 ◽  
Author(s):  
Y. Jiang ◽  
W.Y. Szeto
2014 ◽  
Vol 505-506 ◽  
pp. 533-536
Author(s):  
Yang Wang ◽  
Jin Xin Cao ◽  
Xia Xi Li ◽  
Ri Dong Wang

The transportation network construction takes place over a quite long time span and need enough budget. The budget is from the allocation of funds in phases and the construction cost change in the process of the construction. The general static transportation network design problems ignores the problems above. So the optimal solution obtained by the static model is best in short time, and it is may be unfeasible in the actual situation. Based on the actual situation and the shortage of the static model, the time-dependent transport network design is proposed in this study. The plan horizon is divided into N intervals and a bi-level model is built to describe the problem. The objective of the upper-level is to minimize the total cost of the whole stages. the lower-level model is a user equilibrium model. Then the branch and bound (B-B) algorithm is designed to solve the model. It is obvious that the solution of the time-dependent simulation model is more feasible than the solution of the static sequential design.


2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Yi He ◽  
Ziqi Song ◽  
Lihui Zhang

A traditional discrete network design problem (DNDP) always assumes transportation infrastructure projects to be one-time events and ignores travelers’ delays caused by construction work. In fact, infrastructure construction usually lasts for a long time, and the impact on traffic can be substantial. In this paper, we introduce time dimension into the traditional DNDP to explicitly consider the impact of road construction and adopt an overtime policy to add flexibility to construction duration. We address the problem of selecting road-widening projects in an urban network, determining the optimal link capacity, and designing the schedule of the selected projects simultaneously. A time-dependent DNDP (T-DNDP) model is developed with the objective of minimizing total weighted net user cost during the entire planning horizon. An active-set algorithm is applied to solve the model. A simple example network is first utilized to demonstrate the necessity of considering the construction process in T-DNDP and to illustrate the trade-off between the construction impact and the benefit realized through capacity extension. We also solve the T-DNDP model with data from the Sioux Falls network, which contains 24 nodes, 76 links, and 528 origin-destination (O-D) pairs. Computational results for the problem are also presented.


2021 ◽  
pp. 223-265
Author(s):  
Dmitry Ivanov ◽  
Alexander Tsipoulanidis ◽  
Jörn Schönberger

Sign in / Sign up

Export Citation Format

Share Document