A Constraint Model for Vehicle Routing and Driver Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

A Constraint Model for Vehicle Routing and Driver Scheduling

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.
No file

Dates and versions

inria-00098412 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098412 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More