A model for the periodic optimization of bus dispatching times
A model for the periodic optimization of bus dispatching times
复制标题
DOI：
10.1016/j.apm.2020.02.003
复制
发表时间：
2020-06-01
影响因子：
5
通讯作者：
Gkiotsalitis, K.
中科院分区：
文献类型：
--
作者：
Gkiotsalitis, K.
我们模拟调度时间控制的问题，在滚动的视野下的周期性优化方法反动的旅行时间和乘客需求的干扰。这种模式为交通规划者提供了更大的灵活性，使他们能够在日常运营中调整公交车时刻表。我们证明了我们的周期优化模型是一个凸二次规划，保证其解的全局最优性。为了减少计算负担，我们引入了一个迭代算法，使用梯度近似，以获得一个近似的调度解决方案。所提出的解决方案的方法被发现是显着快于精确的优化方法，二次规划，并保持（几乎）可以忽略不计的最优性差距在现实的总线操作场景。最后，我们表明，我们的定期优化方法优于近视的方法，调整调度时间的每一个巴士行程隔离使用的运营数据，从公交线路302在新加坡。(C)2020作者爱思唯尔公司出版
We model the problem of dispatching time control in rolling horizons following a periodic optimization approach reactionary to travel time and passenger demand disturbances. This model provides more flexibility to transport planners allowing them to adjust the bus schedules during the daily operations. We prove that our periodic optimization model is a convex quadratic program, guaranteeing the global optimality of its solution. To reduce the computational burden, we introduce an iterative algorithm that uses gradient approximations to obtain an approximate dispatching solution. The proposed solution method is found to be significantly faster than exact optimization approaches for quadratic programming and maintains an (almost) negligible optimality gap in realistic bus operation scenarios. Finally, we show that our periodic optimization method outperforms myopic methods that adjust the dispatching time of each bus trip in isolation using operational data from bus line 302 in Singapore. (C) 2020 The Author. Published by Elsevier Inc.