A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems

We consider the vehicles scheduling problem in bicycle sharing systems.We define and formulate a mathematical model to minimize both the operational cost and the waiting times of the stations in disequilibrium states.Several lower and upper bounds were proposed and incorporated in a branch-and-bound algorithm.The obtained results are optimal up to 30 stations within a reasonable amount of computation time.The branch-and-bound algorithm can be converted into a fast greedy search heuristic suitable for large instances. Bicycle sharing systems are transportation systems that allow the users to rent a bicycle at one of many automatic rental stations scattered around the city, use them for a short travel and return them at any station. A crucial factor for the success of such a system is its ability to ensure a good quality of service to users. It means the availability of bicycles for pick-up and free places to return them. This is performed by means of a rebalancing operation, which consists in removing bicycles from some stations and transferring them to other stations, using dedicated vehicles. In this paper, we study the rebalancing vehicles routing problem by considering the static case. Vehicles conduct tours between stations to return them to their desired levels, which are known in advance, and each station must be visited exactly once and only once by a vehicle. This problem is similar to the traveling salesman problem with additional constraints. The aim is to find an optimal scheduling of the vehicle that minimizes the total waiting time of the stations in disequilibrium states. We propose several lower and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.

[1]  Frédéric Meunier,et al.  Balancing the stations of a self service "bike hire" system , 2011, RAIRO Oper. Res..

[2]  Günther R. Raidl,et al.  A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems , 2013, EUROCAST.

[3]  Rafael E. Banchs,et al.  Article in Press Pervasive and Mobile Computing ( ) – Pervasive and Mobile Computing Urban Cycles and Mobility Patterns: Exploring and Predicting Trends in a Bicycle-based Public Transport System , 2022 .

[4]  Günther R. Raidl,et al.  Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach , 2013, EvoCOP.

[5]  A. Ibeas,et al.  Implementing bike-sharing systems , 2011 .

[6]  Ta-Hui Yang,et al.  A hub location inventory model for bicycle sharing system design: Formulation and solution , 2013, Comput. Ind. Eng..

[7]  Karel Martens,et al.  Promoting Bike-and-Ride: The Dutch Experience , 2007 .

[8]  P. DeMaio.  Bike-sharing: History, Impacts, Models of Provision, and Future , 2009 .

[9]  J. Pucher,et al.  Bicycling renaissance in North America? An update and re-appraisal of cycling trends and policies , 2011 .

[10]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[11]  Maria Bordagaray,et al.  Modeling User Perception of Public Bicycle Services , 2012 .

[12]  Frédéric Meunier,et al.  Bike sharing systems: Solving the static rebalancing problem , 2013, Discret. Optim..

[13]  Elise Miller-Hooks,et al.  Fleet Management for Vehicle Sharing Operations , 2011, Transp. Sci..

[14]  Dirk C. Mattfeld,et al.  Understanding Bike-Sharing Systems using Data Mining: Exploring Activity Patterns , 2011 .

[15]  Luca Di Gaspero,et al.  A Hybrid ACO+CP for Balancing Bicycle Sharing Systems , 2013, Hybrid Metaheuristics.

[16]  Ta-Hui Yang,et al.  Strategic design of public bicycle sharing systems with service level constraints , 2011 .

[17]  L Aultman-Hall,et al.  Toronto bicycle commuter safety rates. , 1999, Accident; analysis and prevention.

[18]  Dirk C. Mattfeld,et al.  Modeling of repositioning activities in Bike-Sharing Systems , 2009 .

[19]  Karim Labadi,et al.  An integrated Petri net and GA-based approach for performance optimisation of bicycle sharing systems , 2015 .

[20]  Tal Raviv,et al.  Static repositioning in a bike-sharing system: models and solution approaches , 2013, EURO J. Transp. Logist..

[21]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[22]  Tomás Eiró,et al.  An Optimisation Algorithm to Establish the Location of Stations of a Mixed Fleet Biking System: An Application to the City of Lisbon , 2012 .