Generating feasible schedules for a pick-up and delivery problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 1999

Generating feasible schedules for a pick-up and delivery problem


In this research, we study a transportation problem that involves 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 efficiently schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model and a solution method for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations regardless of different vehicle routes. This provides a global planning over all routes and plays an important role in the solution method. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests. Based on this constraint model, efficient reactive planning and optimization algorithms are constructed to generate feasible schedules for the problem.
No file

Dates and versions

inria-00098910 , version 1 (26-09-2006)


  • HAL Id : inria-00098910 , version 1


Eric Domenjoud, Claude Kirchner, Jianyang Zhou. Generating feasible schedules for a pick-up and delivery problem. Electronic Notes in Discrete Mathematics, 1999, 1. ⟨inria-00098910⟩
106 View
0 Download


Gmail Facebook X LinkedIn More