Abstract
We present a mathematical model and two algorithms for solving a complex combined vehicle and crew scheduling problem. The problem arises in the area of road feeder service (RFS) for air cargo transportation where cargo airlines engage specifically equipped RFS-carriers to serve so-called lines, i.e. regular weekly patterns of trips starting and ending at the central hub, respectively. The complexity of the problem stems from the time windows, the rest regulations for drivers and the highly heterogenous requirements with respect to the fleet. The model can be applied to different planning scenarios at the RFS-carrier as well as the airline. The model and method has been incorporated into a decision support system called block.buster where sequences of single trips are combined to feasible blocks starting and ending at the hub and then combined to feasible vehicle round trips.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ball M, Bodin L and Dial R (1983). A matching based heuristic for scheduling mass transit crews and vehicles. Trans Sci 17: 4–31
Ball M and Roberts A (1985). A graph partitioning approach to airline crew scheduling. Trans Sci 19: 107–126
Bartodziej P, Derigs U, Grein B (2006) A decision support system for strategic and operational planning of road feeder services. In: Haasis H-D, Kopfer H, Schönberger J. (eds) Operations Research Proceedings 2005. Springer, New York, S. 43–48
Blais JY, Lamont J and Rousseau JM (1990). The HASTUS Vehicle and Manpower Scheduling System at the Société de transport de la Communauté urbaine de Montréal. Interface 20: 26–42
Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2): 63–211
Desaulniers G,Desrosiers J, Solomon M (eds) (2005). Column generation GERAD 25th Anniversary Series. Springer, Berlin
Desrochers M and Soumis F (1989). A column generation approach to the urban transit crew scheduling problem. Trans Sci 23(1): S. 1–S. 13
Dueck G (1993). New optimization heuristics. J Computat Phys 104(1): 86–92
Emden-Weinert T (1999) Kombinatorische Optimierungsverfahren für das Crew Scheduling Problem. Doctoral Thesis, Humboldt-Universität Berlin
Freling R, Huisman D and Wagelmans A (2003). Models and algorithms for integration of vehicle and crew scheduling. J Scheduling 6: 83–85
Johnson D, Aragon C, McGeoch L and Schevon C (1989). Optimization by simulated annealing: an experimental evaluation, Part I. Graph partitioning. Oper Res 37(6): 865–892
Lavoie S, Minoux M and Odier E (1988). A new approach for crew pairing problems by column generation with an application to air transportation. Eur J Oper Res 35: 45–58
Proksch M (1997) Simulated Annealing und seine Anwendung auf das Crew Scheduling Problem. Diploma Thesis, Institut für Informatik, Humbold-Universität zu Berlin
Ropke S and Pisinger D (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Trans Sci 40(4): 455–472
Shaw P (1998) A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, APES group
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bartodziej, P., Derigs, U., Malcherek, D. et al. Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportation. OR Spectrum 31, 405–429 (2009). https://doi.org/10.1007/s00291-007-0110-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-007-0110-7