A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
A Lagrangian heuristic for the real-time vehicle rescheduling problem
2009
Transportation Research Part E: Logistics and Transportation Review
When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. The VRSP is proven to be NP-hard, and a Lagrangian relaxation based insertion heuristic is developed. Extensive computational experiments on
doi:10.1016/j.tre.2008.09.002
fatcat:pzddhaueyrc3bjsiecwuo6pjva