A reservoir balancing constraint with applications to bike-sharing
Conference Paper, Proceedings of 13th International Conference on Integration of Constraint Programming, AI, and Operations Research (CPAIOR '16), pp. 216 – 228, May, 2016
Abstract
A global CP constraint is presented which improves the propagation of reservoir constraints on cumulative resources in schedules with optional tasks. The global constraint is incorporated in a CP approach to solve a Single-Commodity Pickup and Delivery Problem: the Bicycle Rebalancing Problem with Time-Windows and heterogeneous fleet. This problem was recently introduced at the 2015 ACP Summer School on Constraint Programming competition. The resulting CP approach outperforms a Branch-and-Bound approach derived from two closely related problems. In addition, the CP approach presented in this paper resulted in a first place position in the competition.
BibTeX
@conference{Kinable-2016-5533,author = {Joris Kinable},
title = {A reservoir balancing constraint with applications to bike-sharing},
booktitle = {Proceedings of 13th International Conference on Integration of Constraint Programming, AI, and Operations Research (CPAIOR '16)},
year = {2016},
month = {May},
pages = {216 – 228},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.