A generalized disjunctive programming model for the static bike sharing rebalancing problem with demand intervals

Solving a static bike sharing rebalancing problem requires finding the minimum-cost route for rebalancing vehicles, subject to meeting the demand at the bike sharing stations of the system. In this work, we study the variant of the problem where the demand is specified by intervals, which adds flexi...

Ausführliche Beschreibung