IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v16y1982i5p383-397.html
   My bibliography  Save this article

Relaxation approaches to large scale bus driver scheduling problems

Author

Listed:
  • Carraresi, P.
  • Gallo, G.
  • Rousseau, J. -M.

Abstract

The bus driver scheduling (BDS) problem in a transit company consists of establishing, at minimum cost, a list of work-days in which a driver is assigned to each bus in the given time-table and all clauses of the union contract are respected. In this paper we present a general mathematical programming formulation for the BDS problem. Because, in general, the problem is too large to be solved directly, we introduce a relation of the problem and three different solution approaches. Computational results obtained on real life problems indicate that mathematical programming techniques can solve the BDS problem efficiently.

Suggested Citation

  • Carraresi, P. & Gallo, G. & Rousseau, J. -M., 1982. "Relaxation approaches to large scale bus driver scheduling problems," Transportation Research Part B: Methodological, Elsevier, vol. 16(5), pages 383-397, October.
    • Handle: RePEc:eee:transb:v:16:y:1982:i:5:p:383-397
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(82)90020-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:16:y:1982:i:5:p:383-397. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.