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...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization and engineering Vol. 26; no. 3; pp. 1781 - 1813
Main Authors:	Ikonen, Teemu J., Heljanko, Keijo, Harjunkoski, Iiro
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Nature B.V 01.09.2025
Subjects:	Algorithms Bicycles Clustering Computing time Customer services Decomposition Demand Heuristic Integer programming Intervals Linear programming Mathematical programming Mixed integer Optimization Traveling salesman problem Vehicle routing Vehicles
ISSN:	1389-4420, 1573-2924
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!