Technical Papers
Aug 14, 2020

Joint Optimization of Road Classification and Road Capacity for Urban Freight Transportation Networks

Publication: Journal of Transportation Engineering, Part A: Systems
Volume 146, Issue 10

Abstract

In previous studies, almost all urban network design models/methods made attempts to optimize transportation system performance, such as minimizing road traffic congestion, by determining optimal road capacity expansion schemes, with the assumption of indestructible road infrastructure. However, road infrastructure definitely deteriorates over time, and needs periodic maintenance and repairs. This paper proposes a bilevel programming model for the urban freight transportation network design problem (UFTNDP) by taking into account the heterogeneity of road classifications and road damages from the perspective of road maintenance. The model aims to improve network performance as much as possible by determining an optimal joint scheme of road capacities and classifications. At the upper level, road planning aims to minimize total system cost by determining a joint optimal scheme of road capacities and road classifications. The lower level is a traffic assignment problem that characterizes network users’ path choice behavior. We then propose an improved system optimum (SO) relaxation–based method to solve the optimization model. Numerical examples validated the developed model and tested the computational efficiency of the proposed algorithm. Numerical results revealed that (1) the improved solution algorithm performs better, because it saves 97.3% of computational time compared with the original SO relaxation–based method; (2) the algorithm has the potential to be extended to solving a general discrete network design problem; and (3) a simultaneous optimization of road classification and capacity works better in improving system performance of an urban freight transportation network.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Some or all data, models, or code generated or used during the study are available from the corresponding author by request, including the traffic network, origin-destination (OD) demand table, link travel time, link volume, and road damage parameters.

Acknowledgments

This study has been substantially supported by the National Natural Science Foundation Council of China through projects (Grant Nos. 71601142, 71531011, and 71890970/71890973), and a project sponsored by the program of Shanghai Academic Research Leader.

References

Bumpy Roads Ahead. 2018. America’s roughest rides and strategies to make our roads smoother. Washington, DC: Road Information Program.
Dodoo, N. A., and N. Thorpe. 2005. “A new approach for allocating pavement damage between heavy goods vehicles for road-user charging.” Transp. Policy 12 (5): 419–430. https://doi.org/10.1016/j.tranpol.2005.06.009.
Dou, X., H. Wang, and Q. Meng. 2019. “Parallel shuttle bus service design for planned mass rapid transit shutdown: The Singapore experience.” Transp. Res. Part C: Emerging Technol. 108: 340–356. https://doi.org/10.1016/j.trc.2019.09.022.
Dueker, M. J., and A. M. Fischer. 2003. “Fixing Swiss potholes.” Econ. Lett. 79 (3): 409–415. https://doi.org/10.1016/S0165-1765(03)00031-4.
Farahani, R. Z., E. Miandoabchi, W. Y. Szeto, and H. Rashidi. 2013. “A review of urban transportation network design problems.” Eur. J. Oper. Res. 229 (2): 281–302. https://doi.org/10.1016/j.ejor.2013.01.001.
Farvaresh, H., and M. M. Sepehri. 2013. “A branch and bound algorithm for bi-level discrete network design problem.” Networks Spatial Econ. 13 (1): 67–106. https://doi.org/10.1007/s11067-012-9173-3.
He, J., W. Deng, Q. Hu, and Z. Liu. 2008. “Urban road grade proportion based on trip mode.” J. Transp. Syst. Eng. Inf. Technol. 8 (5): 88–93. https://doi.org/10.1016/S1570-6672(08)60042-2.
Highway Research Board. 1962. The AASHO road test, report 5, pavement research.. Washington, DC: Highway Research Board.
IBM. 2017. IBM ILOG CPLEX Optimization Studio: CPLEX user’s manual, version 12.7. New York: IBM.
Leblanc, L. J. 1975. “An algorithm for the discrete network design problem.” Transp. Sci. 9 (3): 183–199. https://doi.org/10.1287/trsc.9.3.183.
Liu, H., and D. Z. W. Wang. 2015. “Global optimization method for network design problem with stochastic user equilibrium.” Transp. Res. Part B: Methodol. 72: 20–39. https://doi.org/10.1016/j.trb.2014.10.009.
Long, J., Z. Gao, H. Zhang, and W. Y. Szeto. 2010. “A turning restriction design problem in urban road networks.” Eur. J. Oper. Res. 206 (3): 569–578. https://doi.org/10.1016/j.ejor.2010.03.013.
Luathep, P., A. Sumalee, W. H. K. Lam, Z.-C. Li, and H. K. Lo. 2011. “Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach.” Transp. Res. Part B: Methodol. 45 (5): 808–827. https://doi.org/10.1016/j.trb.2011.02.002.
Martin, T. C., and T. R. Thoresen. 2015. “Estimation of the marginal cost of road wear as a basis for charging freight vehicles.” Res. Transp. Econ. 49: 55–64. https://doi.org/10.1016/j.retrec.2015.04.006.
Meng, Q., H. Yang, and M. G. H. Bell. 2001. “An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem.” Transp. Res. Part B: Methodol. 35 (1): 83–105. https://doi.org/10.1016/S0191-2615(00)00016-3.
Mitradjieva, M., and P. O. Lindberg. 2013. “The stiff is moving—Conjugate direction Frank-Wolfe methods with applications to traffic assignment.” Transp. Sci. 47 (2): 280–293. https://doi.org/10.1287/trsc.1120.0409.
Moreno-Quintero, E. 2006. “Optimal control of road freight flows by route choice inducement: A case from Mexico.” Eur. J. Oper. Res. 175 (3): 1588–1604. https://doi.org/10.1016/j.ejor.2005.02.027.
Moreno-Quintero, E., T. Fowkes, and D. Watling. 2013. “Modelling planner–carrier interactions in road freight transport: Optimisation of road maintenance costs via overloading control.” Transp. Res. Part E: Logistics Transp. Rev. 50: 68–83. https://doi.org/10.1016/j.tre.2012.11.001.
Qu, X., X. Li, M. Wang, and V. Dixit. 2017. “Advances in modelling connected and automated vehicles.” J. Adv. Transp. 2017: 1–3. https://doi.org/10.1155/2017/3268371.
Szeto, W. Y., X. Jaber, and M. O’Mahony. 2010. “Time-dependent discrete network design frameworks considering land use.” Comput.-Aided Civ. Infrastruct. Eng. 25 (6): 411–426. https://doi.org/10.1111/j.1467-8667.2010.00654.x.
Transportation Networks for Research Core Team. 2020. “Transportation networks for research.” Accessed April 2, 2020. https://github.com/bstabler/TransportationNetworks.
Volovski, M., J. Murillo-Hoyos, T. U. Saeed, and S. Labi. 2017. “Estimation of routine maintenance expenditures for highway pavement segments: Accounting for heterogeneity using random-effects models.” J. Transp. Eng. Part A: Syst. 143 (5): 04017006. https://doi.org/10.1061/JTEPBS.0000041.
Wang, D. Z. W., and H. K. Lo. 2010. “Global optimum of the linearized network design problem with equilibrium flows.” Transp. Res. Part B: Methodol. 44 (4): 482–492. https://doi.org/10.1016/j.trb.2009.10.003.
Wang, G., Z. Gao, and M. Xu. 2019. “Integrating link-based discrete credit charging scheme into discrete network design problem.” Eur. J. Oper. Res. 272 (1): 176–187. https://doi.org/10.1016/j.ejor.2018.05.069.
Wang, H., W. H. K. Lam, X. Zhang, and H. Shao. 2015. “Sustainable transportation network design with stochastic demands and chance constraints.” Int. J. Sustainable Transp. 9 (2): 126–144. https://doi.org/10.1080/15568318.2012.740147.
Wang, H., Q. Meng, and X. Zhang. 2020. “Multiple equilibrium behaviors of auto travellers and a freight carrier under the cordon-based large-truck restriction regulation.” Transp. Res. Part E: Logistics Transp. Rev. 134 (Feb): 101829. https://doi.org/10.1016/j.tre.2019.101829.
Wang, H., G.-Y. Xiao, L.-Y. Zhang, and Y. Ji. 2014. “Transportation network design considering morning and evening peak-hour demands.” Math. Prob. Eng. 2014: 1–10. https://doi.org/10.1155/2014/806916.
Wang, H., and X. Zhang. 2017. “Game theoretical transportation network design among multiple regions.” Ann. Oper. Res. 249 (1–2): 97–117. https://doi.org/10.1007/s10479-014-1700-9.
Wang, S., Q. Meng, and H. Yang. 2013. “Global optimization methods for the discrete network design problem.” Transp. Res. Part B: Methodol. 50: 42–60. https://doi.org/10.1016/j.trb.2013.01.006.
Ye, Y., and H. Wang. 2018. “Optimal design of transportation networks with automated vehicle links and congestion pricing.” J. Adv. Transp. 2018: 1. https://doi.org/10.1155/2018/3435720.
Zhou, M., X. Qu, and S. Jin. 2016. “On the impact of cooperative autonomous vehicles in improving freeway merging: A modified intelligent driver model-based approach.” IEEE Trans. Intell. Transp. Syst. 18 (6): 1–7. https://doi.org/10.1109/TITS.2016.2606492.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering, Part A: Systems
Journal of Transportation Engineering, Part A: Systems
Volume 146Issue 10October 2020

History

Received: Apr 3, 2020
Accepted: Jun 8, 2020
Published online: Aug 14, 2020
Published in print: Oct 1, 2020
Discussion open until: Jan 14, 2021

Permissions

Request permissions for this article.

Authors

Affiliations

Yipeng Ye, Ph.D. [email protected]
Lecturer, School of Economics and Management, Wuyi Univ., Guangdong 529020, China. Email: [email protected]
Senior Research Fellow, Dept. of Civil and Environmental Engineering, National Univ. of Singapore, Singapore 117576, Singapore (corresponding author). ORCID: https://orcid.org/0000-0002-7150-5247. Email: [email protected]
Xiaoning Zhang, Ph.D. [email protected]
Professor, School of Economics and Management, Tongji Univ., Shanghai 200092, China. Email: [email protected]
Associate Professor, College of Civil and Transportation Engineering, Hohai Univ., Nanjing 210098, China. ORCID: https://orcid.org/0000-0001-9692-3771. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share