This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Hamdouni, M. Articles by van Putten, M. Search for Related Content

Dispatching Buses in a Depot Using Block Patterns

École Polytechnique de Montréal, C.P. 6079, succursale Centre-ville, Montréal, Québec, Canada H3C 3A7
École Polytechnique de Montréal, C.P. 6079, succursale Centre-ville, Montréal, Québec, Canada H3C 3A7
Départment d’informatique, Université du Québec à Montréal, C.P. 8888, succursale Centre-ville, Montréal, Québec, Canada H3C 3P8
Département de mathématiques et génie industriel, École Polytechnique de Montréal, C.P. 6079, succursale Centre-ville, Montréal, Québec, Canada H3C 3A7
Eindhoven University of Technology, Eindhoven, The Netherlands
mohamed.hamdouni{at}gerad.ca
guy.desaulniers{at}gerad.ca
odile.marcotte{at}gerad.ca
francois.soumis{at}gerad.ca
mpvanputten{at}gmail.com

In this article we consider the problem of assigning parking slots to buses of different types so that the required buses can be dispatched easily in the morning. More precisely, if a bus of a certain type is needed at a given time, the buses that precede it in the lane must have departed already. Thus care must be taken to ensure that the buses arriving in the evening are parked in an order compatible with the types required for the morning departures. Maneuvers (i.e., rearrangements of buses within lanes) might be necessary to achieve this goal. Because the transit authorities need robust solutions to this problem (known as the dispatching problem in the literature), we formulate a model in which the depot lanes are filled according to specific patterns, called one-block or two-block patterns. We present two versions of this model, study their properties, and show that some real-life instances can be solved within reasonable times by a commercial MIP solver. We also demonstrate that the solutions of the model are very robust, and can thus be used by transit authorities.

Key Words: bus parking and dispatching; integer programming; robust solutions

This article has been cited by other articles:

				L. G. Kroon, R. M. Lentink, and A. Schrijver Shunting of Passenger Train Units: An Integrated Approach Transportation Science, November 1, 2008; 42(4): 436 - 449. [Abstract] [PDF]