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 条
  • [41] Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches
    Cerulli, Raffaele
    D'Ambrosio, Ciriaco
    Iossa, Antonio
    Palmieri, Francesco
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (01): : 1330 - 1355
  • [42] Dynamic user-optimal departure time/route choice with hard time-windows
    Chen, HK
    Chang, MS
    JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2000, 126 (05): : 413 - 418
  • [43] Discrete-time dynamic user-optimal departure time route choice model
    Chen, HK
    Hsueh, CF
    JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1998, 124 (03): : 246 - 254
  • [44] Departure time choice behavior in commute problem with stochastic bottleneck capacity: experiments and modeling
    Liu, Qiumin
    Lu, Dongxu
    Jiang, Rui
    Han, Xiao
    Liu, Ronghui
    Gao, Ziyou
    TRANSPORTMETRICA A-TRANSPORT SCIENCE, 2023, 19 (02)
  • [45] Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches
    Raffaele Cerulli
    Ciriaco D’Ambrosio
    Antonio Iossa
    Francesco Palmieri
    The Journal of Supercomputing, 2022, 78 : 1330 - 1355
  • [46] Experimental study of departure time choice behavior in commute problem with stochastic bottleneck capacity
    Lu, Dongxu
    Jiang, Rui
    Han, Xiao
    Yang, Yong
    Liu, Qiumin
    2019 5TH INTERNATIONAL CONFERENCE ON TRANSPORTATION INFORMATION AND SAFETY (ICTIS 2019), 2019, : 1146 - 1151
  • [47] Drivers' mental representation of travel time and departure time choice in uncertain traffic network conditions
    Fujii, S
    Kitamura, R
    NETWORKS & SPATIAL ECONOMICS, 2004, 4 (03): : 243 - 256
  • [48] Drivers' Mental Representation of Travel Time and Departure Time Choice in Uncertain Traffic Network Conditions
    Satoshi Fujii
    Ryuichi Kitamura
    Networks and Spatial Economics, 2004, 4 : 243 - 256
  • [49] A Departure Time Choice for Morning Commute Considering Train Capacity of a Rail Transit Line
    Feng, Jia
    Mao, Baohua
    Chen, Zhijie
    Bai, Yun
    Li, Minggao
    ADVANCES IN MECHANICAL ENGINEERING, 2013,
  • [50] DYNAMIC USER EQUILIBRIUM DEPARTURE TIME AND ROUTE CHOICE ON IDEALIZED TRAFFIC ARTERIALS
    MAHMASSANI, H
    HERMAN, R
    TRANSPORTATION SCIENCE, 1984, 18 (04) : 362 - 384