Balancing the stations of a self service “bike hire” system
From MaRDI portal
Publication:3016180
DOI10.1051/ro/2011102zbMath1222.90073OpenAlexW2111237817MaRDI QIDQ3016180
Pascal Benchimol, Benoît Chappert, Mike Benchimol, Ludovic Robinet, Fabien Laroche, Frédéric Meunier, Arnaud de la Taille
Publication date: 14 July 2011
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/197838
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (22)
Balancing bike sharing systems with constraint programming ⋮ Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ The static bicycle relocation problem with demand intervals ⋮ A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ An exact algorithm for the static rebalancing problem arising in bicycle sharing systems ⋮ Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds ⋮ A heuristic algorithm for a single vehicle static bike sharing rebalancing problem ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems ⋮ Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms ⋮ Large neighborhood search for the bike request scheduling problem ⋮ Branch-and-cut for a 2-commodity flow relocation model with time constraints ⋮ Shared mobility systems ⋮ The dynamic bowser routing problem ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ Shared mobility systems: an updated survey ⋮ A two-phase heuristic approach to the bike repositioning problem ⋮ Data-Driven Rebalancing Methods for Bike-Share Systems ⋮ Inventory rebalancing and vehicle routing in bike sharing systems ⋮ Inventory rebalancing through pricing in public bike sharing systems
Cites Work
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Separating capacity constraints in the CVRP using tabu search
- Algorithms for Capacitated Vehicle Routing
- The swapping problem
- Approximating Capacitated Routing and Delivery Problems
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Algorithms and Computation
This page was built for publication: Balancing the stations of a self service “bike hire” system
