Skip to Main content Skip to Navigation

A Constraint Model for Vehicle Routing and Driver Scheduling

Eric Domenjoud 1 Jianyang Zhou
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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. Its solution involves planning itineraries for buses and establishing working schedule for drivers, subject to vehicle capacity limitation and time constraints. The objective is to optimally schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations, which provides a global planning over all routes. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests.
Document type :
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Monday, September 25, 2006 - 4:53:31 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00098412, version 1



Eric Domenjoud, Jianyang Zhou. A Constraint Model for Vehicle Routing and Driver Scheduling. [Intern report] 98-R-016 || domenjoud98a, 1998, 15 p. ⟨inria-00098412⟩



Record views