Time-Dependent Discrete Transportation Network Design

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 505-506)
• Pages: 533-536
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.505-506.533
• Online since: January 2014
• Authors: Yang Wang, Jin Xin Cao*, Xia Xi Li, Ri Dong Wang
• Keywords: Bi-Level Model, Bound (B-B) Method, Discrete Network Design Problem (DNDP), Time-Dependent Transportation Network Design

References

[1] H.K. Lo, W.Y. Szeto, Planning transport network improvements over time. In: Urban and Regional Transportation Modeling, Essays in Honor of David Boyce, Edward Elgar Publishing. (2004)157-176.

DOI: 10.4337/9781845420536.00015

[2] W.Y. Szeto, H.K. Lo, Strategies for road network design over time: Robustness under uncertainty, Transportmetrica. 1(2005)74-63.

DOI: 10.1080/18128600508685642

[3] W.Y. Szeto, H.K. Lo, Time-dependent transport network improvement and tolling strategies, Transportation Research Part A. 42(2008)376-391.

DOI: 10.1016/j.tra.2007.10.003

[4] H.K. Lo, W.Y. Szeto, Time-dependent transport network design under cost-recovery, Transportation Research Part B: Methodological. 43(2009)142-158.

DOI: 10.1016/j.trb.2008.06.005

[5] W.Y. Szeto, Time-dependent discrete network design frameworks considering land use, Computer-Aided Civil and Infrastructure Engineering. 25(2010)411-426.

DOI: 10.1111/j.1467-8667.2010.00654.x

[6] Z.Y. Gao., J.J. Wu, H.J. Sun, Solution algorithm for the bi-level discrete network design problem, Transportation Research Part B: Methodological. 39(2005)479-495.

DOI: 10.1016/j.trb.2004.06.004

[7] T.F. Xie, G.Q. Chen, J.X. Cao, Network design problem with construction costs uncertainty, Journal of Transportation System Engineering and Information Technology. 13(2003) 34-54.

[8] H. Farvaresh, M.M. Sepehri, A branch and bound algorithm for bi-level discrete network design problem, Networks and Spatial Economics. 13(2013)67-106.

DOI: 10.1007/s11067-012-9173-3

[9] R. Fletcher, S. Leyffer, Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming. 66(1994)327-349.

DOI: 10.1007/bf01581153