Inventory rebalancing and vehicle routing in bike sharing systems

Abstract

Bike sharing systems have been installed in many cities around the world and are increasing in popularity. A major operational cost driver in these systems is rebalancing the bikes over time such that the appropriate number of bikes and open docks are available to users. We combine two aspects that have previously been handled separately in the literature: determining service level requirements at each bike sharing station, and designing (near-)optimal vehicle routes to rebalance the inventory. Since finding provably optimal solutions is practically intractable, we propose a new cluster-first route-second heuristic, in which the polynomialsize Clustering Problem simultaneously considers the service level feasibility constraints and approximate routing costs. Extensive computational results on real-world data from Hubway (Boston, MA) and Capital Bikeshare (Washington, DC) are provided, which show that our heuristic outperforms a pure mixed integer programming formulation and a constraint programming approach.

A Dual Hesitant Fuzzy Rough Pattern Recognition Approach Based on Deviation Theories and Its Application in Urban Traffic Modes Recognition

“…For convenience, the modes are denoted as M = {M 1 , M 2 , M 3 , M 4 }, where M 1 stands for "bicycle", M 2 stands for "electric bicycle", M 3 stands for "shared bicycle", M 4 stands for "bus". More details about "shared bicycle", please refer to Schuijbroek et al [18] and Chemla et al [19]. Which classical traffic mode would be affected by the greatest extent when the shared electric bicycles are put into the studied market?…”

Innovative Bike-Sharing in China: Solving Faulty Bike-Sharing Recycling Problem

“…Chemla et al [19] were the first to introduce rebalancing operations for bike-sharing system and proposed tabu search algorithms for solving it. Schuijbroek et al [20] presented unified dual-bounded service level constraints that add inventory flexibility and vehicle routing for static rebalancing in bikesharing systems. Ghosh et al [21] developed an optimization formulation to reposition bikes using vehicles while considering the routes for vehicles and future expected demand to improve bike-sharing availability and reduce the usage of private vehicles.…”

Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems

“…Using a discrete Markov Chain, they approximate the expected number of out-of-stock events over a finite time-horizon. For fixed rates, the work of Schuijbroek et al [2017] and O'Mahony [2015] give different techniques to compute the expected number of out-of-stock events exactly. A recursion suggested by Parikh and Ukkusuri [2014] shows that these methods extend to piecewise-constant settings.…”