Solving a Dial-a-Ride Problem with Constraint Propagation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Solving a Dial-a-Ride Problem with Constraint Propagation

Abstract

We present a method based on constraint propagation for solving a transportation problem for handicapped people. The bus station needs to provide daily services for passengers. Each service requires a driver to pick up some passengers somewhere and send them to their destination, subject to vehicle capacity limitations and time constraints. The bus station hopes to optimally schedule its fleet of vehicles so as to reduce costs.
No file

Dates and versions

inria-00108047 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00108047 , version 1

Cite

Eric Domenjoud, Jianyang Zhou. Solving a Dial-a-Ride Problem with Constraint Propagation. CORS/INFORMS meeting, 1999, Montréal. ⟨inria-00108047⟩
49 View
0 Download

Share

Gmail Facebook X LinkedIn More