Imagen de Portada

A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution

Guardado en:
Publicado en:Journal of Heuristics vol. 17, no. 4 (Aug 2011), p. 441
Autor principal: De Leone, Renato
Otros Autores: Festa, Paola, Marchitto, Emilia
Publicado:
Springer Nature B.V.
Materias:
Italy
Studies
Mathematical models
Statistical analysis
Heuristic
Scheduling
Bus drivers
Transportation services
Working hours
Costs
Transportation industry
Public transportation
Decomposition
Linear programming
Operations research
Acceso en línea:Citation/Abstract
Full Text
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen:This paper addresses the problem of determining the best scheduling for Bus Drivers, a N P-hard problem consisting of finding the minimum number of drivers to cover a set of Pieces-Of-Work (POWs) subject to a variety of rules and regulations that must be enforced such as spreadover and working time. This problem is known in literature as Crew Scheduling Problem and, in particular in public transportation, it is designated as Bus Driver Scheduling Problem. We propose a new mathematical formulation of a Bus Driver Scheduling Problem under special constraints imposed by Italian transportation rules. Unfortunately, this model can only be usefully applied to small or medium size problem instances. For large instances, a Greedy Randomized Adaptive Search Procedure (GRASP) is proposed. Results are reported for a set of real-word problems and comparison is made with an exact method. Moreover, we report a comparison of the computational results obtained with our GRASP procedure with the results obtained by Huisman et al. (Transp. Sci. 39(4):491-502, 2005). [PUBLICATION ABSTRACT]
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-010-9141-3
Fuente:ABI/INFORM Global