Relaxation approaches to large scale bus driver scheduling problems
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 16 (1982)
Issue (Month): 5 (October)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
If references are entirely missing, you can add them using this form.