|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||A Probabilistic Model for Vehicle Scheduling Based on Stochastic Trip Times|
Stochastic trip time
|Citation:||Shen Y, Xu J & Li J (2016) A Probabilistic Model for Vehicle Scheduling Based on Stochastic Trip Times. Transportation Research - Part B - Methodological, 85, pp. 19-31. https://doi.org/10.1016/j.trb.2015.12.016|
|Abstract:||Vehicle scheduling plays a profound role in public transit planning. Traditional approaches for the Vehicle Scheduling Problem (VSP) are based on a set of predetermined trips in a given timetable. Each trip contains a departure point/time and an arrival point/time whilst the trip time (i.e. the time duration of a trip) is fixed. Based on fixed durations, the resulting schedule is hard to comply with in practice due to the variability of traffic and driving conditions. To enhance the robustness of the schedule to be compiled, the VSP based on stochastic trip times instead of fixed ones is studied. The trip times follow the probability distributions obtained from the data captured by Automatic Vehicle Locating (AVL) systems. A network flow model featuring the stochastic trips is devised to better represent this problem, meanwhile the compatibility of any pair of trips is redefined based on trip time distributions instead of fixed values as traditionally done. A novel probabilistic model of the VSP is proposed with the objectives of minimizing the total cost and maximizing the on-time performance. Experiments show that the probabilistic model may lead to more robust schedules without increasing fleet size.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|TRB2016.pdf||Fulltext - Published Version||589.83 kB||Adobe PDF||Under Embargo until 2999-12-16 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.