This paper introduces the static bike relocation problem with multiple vehicles and visits, the objective of which is to rebalance at minimum cost the stations of a bike sharing system using a fleet of vehicles. The vehicles have identical capacities and service time limits, and are allowed to visit the stations multiple times. We present an integer programming formulation, implemented under a branch-and-cut scheme, in addition to an iterated local search metaheuristic that employs efficient move evaluation procedures. Results of computational experiments on instances ranging from 10 to 200 vertices are provided and analyzed. We also examine the impact of the vehicle capacity and of the number of visits and vehicles on the performance of the proposed algorithms.
- Bike sharing
- Pickup and delivery
- Shared mobility systems
ASJC Scopus subject areas
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management
FingerprintDive into the research topics of 'The static bike relocation problem with multiple vehicles and visits'. Together they form a unique fingerprint.
- Management - Professor
- Information, Decisions & Operations - Director of Studies MSc in Business Analytics
- Bath Centre for Healthcare Innovation and Improvement
- Institute for Mathematical Innovation (IMI)
- Smart Warehousing and Logistics Systems
Person: Research & Teaching, Researcher