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
Reports Year : 1998

Generating feasible schedules for a pick-up and delivery problem

Claude Kirchner
Jianyang Zhou
  • Function : Author
  • PersonId : 835307


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 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. 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 real-time response and optimization algorithms are constructed to generate feasible schedules for the problem.
No file

Dates and versions

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


  • HAL Id : inria-00098611 , version 1


Eric Domenjoud, Claude Kirchner, Jianyang Zhou. Generating feasible schedules for a pick-up and delivery problem. [Intern report] 98-R-142 || domenjoud98b, 1998, 15 p. ⟨inria-00098611⟩
73 View
0 Download


Gmail Facebook Twitter LinkedIn More