Dispatching Buses in Parking Depots
- 1 August 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 35 (3) , 322-330
- https://doi.org/10.1287/trsc.35.3.322.10151
Abstract
Very often, space is a scarce resource in bus depots located in congested urban areas: Vehicles arriving at the end of their trips are packed together in a rather small space. This implies that when a vehicle has to leave to start a new trip, most often other vehicles have to be moved to clear the way. Here a new model, based on “Noncrossing Matching” and “Generalized Assignment,” is presented to allocate parking spaces to vehicles in a depot to minimize the shunting cost. The results obtained by applying this approach to a real-life case are discussed.Keywords
This publication has 6 references indexed in Scilit:
- Real-time dispatch of trams in storage yardsAnnals of Operations Research, 2000
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow ProblemsINFORMS Journal on Computing, 1999
- A Branch-and-Price Algorithm for the Generalized Assignment ProblemOperations Research, 1997
- Efficient labelling algorithms for the maximum noncrossing matching problemDiscrete Applied Mathematics, 1993
- Exact and approximate solutions of the container ship stowage problemComputers & Industrial Engineering, 1993
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987