Time-Dependent Transportation Network Design considering Construction Impact
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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Journal of Advanced Transportation |
Online Access: | http://dx.doi.org/10.1155/2018/2738930 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832558804534820864 |
---|---|
author | Yi He Ziqi Song Lihui Zhang |
author_facet | Yi He Ziqi Song Lihui Zhang |
author_sort | Yi He |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-7198ad973afa4a06b21da5fb6d84562a |
institution | Kabale University |
issn | 0197-6729 2042-3195 |
language | English |
publishDate | 2018-01-01 |
publisher | Wiley |
record_format | Article |
series | Journal of Advanced Transportation |
spelling | doaj-art-7198ad973afa4a06b21da5fb6d84562a2025-02-03T01:31:35ZengWileyJournal of Advanced Transportation0197-67292042-31952018-01-01201810.1155/2018/27389302738930Time-Dependent Transportation Network Design considering Construction ImpactYi He0Ziqi Song1Lihui Zhang2Department of Civil and Environmental Engineering, Utah State University, Logan, UT 84322, USADepartment of Civil and Environmental Engineering, Utah State University, Logan, UT 84322, USAInstitute of Transportation Engineering, Zhejiang University, Hangzhou, Zhejiang 310058, ChinaA 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.http://dx.doi.org/10.1155/2018/2738930 |
spellingShingle | Yi He Ziqi Song Lihui Zhang Time-Dependent Transportation Network Design considering Construction Impact Journal of Advanced Transportation |
title | Time-Dependent Transportation Network Design considering Construction Impact |
title_full | Time-Dependent Transportation Network Design considering Construction Impact |
title_fullStr | Time-Dependent Transportation Network Design considering Construction Impact |
title_full_unstemmed | Time-Dependent Transportation Network Design considering Construction Impact |
title_short | Time-Dependent Transportation Network Design considering Construction Impact |
title_sort | time dependent transportation network design considering construction impact |
url | http://dx.doi.org/10.1155/2018/2738930 |
work_keys_str_mv | AT yihe timedependenttransportationnetworkdesignconsideringconstructionimpact AT ziqisong timedependenttransportationnetworkdesignconsideringconstructionimpact AT lihuizhang timedependenttransportationnetworkdesignconsideringconstructionimpact |