Relaxation approaches to large scale bus driver scheduling problems

P. Carraresi, G. Gallo and J. -M. Rousseau

Transportation Research Part B: Methodological, 1982, vol. 16, issue 5, 383-397

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.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(82)90020-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:16:y:1982:i:5:p:383-397

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().