Solving a Dial-a-Ride Problem with Constraint Propagation
Résumé
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.