A vehicle-based service system might be susceptible to unexpected costs and delays due to unforeseen events, such as a vehicle breakdown, a traffic accident, a medical emergency, etc. In such situations, a priori algorithmic solution may be deteriorated and fleet plans may need to be adjusted in real-time as a function of the dynamic system state. I consider real-time logistics management problems where a vehicle breaks down in the midst of operations. First, a backup vehicle needs to be determined to pick up the passengers/cargo from the breakdown vehicle, and from the breakdown point completing the remaining portion of the planned trip. This backup vehicle can be dispatched from the depot or from the vehicles currently in service. In the former case, it may impose a significant delay if the depot is far away from the breakdown location. In the latter case, the vehicle used as backup may have to change its own schedule. Trips uncompleted by this backup vehicle may have to be further covered by other vehicles. Thus, a good solution should be acquired in conjunction with the status of all other vehicles in the entire network.Yet, the new schedule may be considerably different from the original one after rescheduling is done. These changes may make the crew-rescheduling problem challenging, since it is essential to ensure that all crews know the itinerary of their new trips. Furthermore, the vehicle breakdown may not only delay the current trip that is directly affected by the disruption but also other trips that the breakdown vehicle has to cover in the network. Some of the delayed trips may have to be cancelled. A good approach should consider operating cost, fixed vehicle cost, delay cost, schedule disruption cost as well as trip cancellation cost simultaneously. This real-time logistics management problem has not been properly addressed in the literature.The major contributions of this study are the modeling and formulation of this vehicle rescheduling problem, and the development of some fast algorithms to solve it quickly. The exact algorithms or heuristics are proposed based on the different requirements and assumptions of the problem.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/193821 |
| Date | January 2006 |
| Creators | Li, Jingquan |
| Contributors | Mirchandani, Pitu B., Mirchandani, Pitu B., Sen, Suvrajeet, Lin, Wei H., Hickman, Mark, Ramasubramanian, Srinivasan |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | English |
| Detected Language | English |
| Type | text, Electronic Dissertation |
| Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.0022 seconds