Allocating Departure Time Slots to Optimize Dynamic Network Capacity

被引:1
|
作者
Ma, Yinyi [1 ]
van Zuylen, Henk J. [2 ,3 ]
Chen, Yusen [2 ]
van Dalen, Jan [1 ]
机构
[1] Erasmus Univ, Dept Decis & Informat Sci, NL-3062 PA Rotterdam, Netherlands
[2] Delft Univ Technol, Sect Transportat & Planning, NL-2600 GA Delft, Netherlands
[3] Hunan Univ, Transportat Infrastruct & Logist Res Sch, Changsha 410082, Hunan, Peoples R China
关键词
RELIABILITY; CHOICE;
D O I
10.3141/2197-12
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
The concept of allocation of departure time slots is applied to alleviate and analyze road transport congestion. Demand is redistributed over departure time slots at on-ramps to analyze its relationship with the congestion in the network with minimized system travel time and optimized network utilization. The objective is to minimize the costs of early and late departure associated with any differences between the cumulative desired and optimum demand, with network capacity as a constraint. The genetic algorithm, a global-searching algorithm, is used to calculate the objective function. Then the consequences of the optimum demand for the traffic states are assessed through network simulation. The application of the approach of the A15 motorway in the Netherlands shows that early departure occurs for short journeys with low demand and late departure occurs mostly for long journeys with high demand. Moreover, the traffic state improves greatly with 7.0% reduction in total travel time and 8.9% reduction in congestion of temporal-spatial combinations. Authorities may use these results to take measures or make design policies that promote time-slot allocation, such as providing rewards for late or early departure outside the peak period.
引用
收藏
页码:98 / 106
页数:9
相关论文
共 50 条
  • [31] Allocating Dynamic Time-Spectrum Blocks In Cognitive Radio Networks
    Yuan, Yuan
    Bahl, Paramvir
    Chandra, Ranveer
    Moscibroda, Thomas
    Wu, Yunnan
    MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2007, : 130 - 139
  • [32] Integration of Departure Time Choice Modeling and Dynamic Origin-Destination Demand Estimation in a Large-Scale Network
    Shafiei, Sajjad
    Saberi, Meead
    Vu, Hai L.
    TRANSPORTATION RESEARCH RECORD, 2020, 2674 (09) : 972 - +
  • [33] A Dynamic guaranteed time slots allocation scheme in wireless sensor networks
    Li, Xiaoji
    Chen, Chen
    Xu, Xiaowei
    Qiu, Hongbing
    Mo, Wei
    Journal of Computational Information Systems, 2010, 6 (07): : 2305 - 2311
  • [34] DYNAMIC COMMUNICATION NETWORK WITH CAPACITY CONSTRAINTS
    FRANK, H
    ELBARDAI, MT
    IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1969, CO17 (04): : 432 - &
  • [35] Optimal Balance of Departure Queues on Different Direction Subject to Dynamic Airport Capacity Envelope
    Wei, Gao
    Zheng, Zhang
    2011 INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING AND TECHNOLOGY (ICMET 2011), 2011, : 445 - 448
  • [36] BEHAVIORAL ANALYSIS OF DEPARTURE TIME DECISION CONSIDERING REDUNDANCY OF RAILROAD NETWORK
    Takada, Kazuyuki
    Fujiu, Makoto
    Sugiyama, Shigeki
    ROAD AND RAIL INFRASTRUCTURE II, 2012, : 81 - 87
  • [37] Departure Time and Mode Choice for the Morning Commute in a Highway/Railway Network
    Wu, Wen-Xiang
    Huang, Hai-Jun
    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 127 - +
  • [38] Prediction of Chaotic Time-Series with a Resource-Allocating RBF Network
    Roman Rosipal
    Miloš Koska
    Igor Farkaš
    Neural Processing Letters, 1998, 7 : 185 - 197
  • [39] Prediction of chaotic time-series with a resource-allocating RBF network
    Rosipal, R
    Koska, M
    Farkas, I
    NEURAL PROCESSING LETTERS, 1998, 7 (03) : 185 - 197
  • [40] Dynamic user-optimal departure time/route choice problem with time-window
    Chen, HK
    Chang, MS
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2000, 23 (01) : 71 - 81