PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems

  title={PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems},
  author={Marian Rainer-Harbach and Petrina Papazek and G{\"u}nther R. Raidl and Bin Hu and Christian Kloim{\"u}llner},
  journal={Journal of Global Optimization},
We consider a transportation problem arising in public bicycle sharing systems: To avoid rental stations to run entirely empty or full, a fleet of vehicles continuously performs tours moving bikes among stations. In the static problem variant considered in this paper, we are given initial and target fill levels for all stations, and the goal is primarily to find vehicle tours including corresponding loading instructions in order to minimize the deviations from the target fill levels. As… 
Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid
This work addresses the static problem variant assuming initial fill levels for each station and seeks vehicle tours with corresponding loading instructions to reach given target fill levels as far as possible to minimize the absolute deviation between target and final fill levels.
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case
This work extends the previous work on the static variant of the problem by introducing an efficient way to model the dynamic case as well as adapting the previous greedy and PILOT construction heuristic, variable neighborhood search and GRASP.
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems
This work addresses the issue of how to rebalance public bicycle sharing systems by a novel simplified problem definition in conjunction with a Cluster-First Route-Second approach and is able to solve instances with up to 60 stations which was not possible with previous problem definitions.
The multiple vehicle balancing problem
This paper proposes an integer linear programming formulation of the multiple vehicle balancing problem and introduces strengthening valid inequalities, obtaining proven optimal solutions for MVBP instances with up to 25 stations.
Service Network Design of Bike Sharing Systems with Resource Constraints
This work presents a service network design formulation for the bike sharing redistribution problem taking into account trip-based user demand and explicitly considering service times for bike pick-up and delivery, and solves the problem using a two-stage MILP-based heuristic and presents computational results for small real-world instances.
Solution space analysis for the bike request scheduling problem
An expression for the cardinality of the solution space is proposed, and lower bounds are derived which show that enumeration is intractable and random search is generally ineffective.
A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems
This work proposes a multilevel refinement heuristic operating on hierarchically clustered input data based on real-world input data for the city of Vienna and introduces a novel approach which is particularly designed to scale well to large real- world instances.


Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach
A general Variable Neighborhood Search with an embedded Variable Neighborhood Descent that exploits a series of neighborhood structures that yields good solutions and scales much better to larger instances than two mixed integer programming approaches.
Static repositioning in a bike-sharing system: models and solution approaches
This paper presents two mixed integer linear program formulations of a routing model that generalizes existing routing models in the literature and indicates that one of the formulations is very effective in obtaining high quality solutions to real life instances of the problem.
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations
This work provides a new, practically more efficient method for calculating proven optimal loading operations based on two maximum flow computations and indicates that this combined approach yields significantly better results than the original variable neighborhood search.
A Geo-Aware and VRP-Based Public Bicycle Redistribution System
Public Bicycle System (PBS) has been developed for short-distance transportation as a part of the mass transportation system. The supply and demand of bikes in PBS is usually unbalanced at different
Bike sharing systems: Solving the static rebalancing problem
Inventory rebalancing and vehicle routing in bike sharing systems
Constraint-Based Approaches for Balancing Bike Sharing Systems
This paper introduces two novel constraint models for the BBSS including a smart branching strategy that focusses on the most promising routes and incorporates both models in a Large Neighborhood Search LNS approach that is adapted to the respective CP model.
Large-Scale Vehicle Sharing Systems: Analysis of Vélib'
A quantitative analysis of the pioneering large-scale bicycle sharing system, Vélib' in Paris, France, provides key insights on the functioning of such systems and serves to inform policy makers in other urban communities wanting to explore bicycle-sharing systems.
A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows
Transportation problems appear in many practically highly relevant areas of our daily life. In this work we deal with a generalized variant of the classical Vehicle Routing Problem (VRP), namely the
Dynamic Vehicle Redistribution and Online Price Incentives in Shared Mobility Systems
It is shown that it is possible to trade off reward payouts to customers against the cost of hiring staff to redistribute bicycles, in order to minimize operating costs for a given desired service level.