Summary
A driver-vehicle scheduling problem in a limousines rental company is studied. Given a set of trip demands to be covered, the goal is to find a driver-vehicle schedule that covers as many as possible of the required demands while satisfying a set of imperative constraints and optimizing several cost objectives. A formulation of the problem is given and a solution approach using local search is developed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Borndörfer, A. Löbel, and S. Weider. A bundle method for integrated multidepot vehicle and duty scheduling in public transit,CASPT 2004, Aug. 2004.
R. Freling, D. Huisman, and A.P.M. Wagelmans. Models and algorithms for integration of vehicle and crew scheduling. Journal of Scheduling, 6:63–85, 2003.
P. Galinier and J.K. Hao. A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1):63–85, 2004.
D. Huisman. Integrated and Dynamic Vehicle and Crew Scheduling. PhD thesis, Erasmus University Rotterdam, 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laurent, B., Guihaire, V., Hao, JK. (2006). A Heuristic Solution for a Driver-Vehicle Scheduling Problem. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_110
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)