Abstract
In this research, we study a transportation problem which is concerned with vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers, subject to vehicle capacity limitation and time constraints. The objective is to efficiently schedule the fleet of vehicles for customer demand so as to reduce costs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E. Domenjoud, C. Kirchner and J. Zhou. A method for solving vehicle routing and scheduling problems. ERCIM/COMPULOG Workshop on Constraints, Schloss Hagenberg, Austria, Oct. 1997
E. Domenjoud, C. Kirchner and J. Zhou. Generating feasible schedules for a pick-up and delivery problem. Technical report 98-R-142 Loria 1998
J. Zhou. A permutation-based approach for solving the job-shop problem. Constraints 2(2) 185–213. Oct. 1997
J. Zhou. Designing and implementing a natural constraint language for solving combinatorial problems. Technical report 97-R-199 Loria 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domenjoud, ]., Kirchner, C., Zhou, J. (1998). Generating feasible schedules for a pick-up and delivery problem. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_38
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive