期刊
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2017
卷 10328, 期 -, 页码 186-198出版社
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-319-59250-3_16
关键词
-
资金
- NSF [CCF-1526067, CMMI-1537394, CCF-1522054, CMMI-1200315]
- Army Research Office [W911NF-17-1-0094]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [1526067] Funding Source: National Science Foundation
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [1537394] Funding Source: National Science Foundation
The growing popularity of bike-sharing systems around the world has motivated recent attention to models and algorithms for the effective operation of these systems. Most of this literature focuses on their daily operation for managing asymmetric demand. In this work, we consider the more strategic question of how to allocate dock-capacity in such systems. Our main result is a practically fast polynomial-time allocation algorithm to compute optimal solutions for this problem, that can also handle a number of practically motivated constraints, such as a limit on the number of docks moved from a given allocation. Our work further develops connections between bike-sharing models and the literature on discrete convex analysis and optimization.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据