An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
From MaRDI portal
Publication:319656
DOI10.1016/j.ejor.2015.03.043zbMath1346.90104OpenAlexW2099225386MaRDI QIDQ319656
Maria Battarra, Roberto Wolfler Calvo, Güneş Erdoğan
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://opus.bath.ac.uk/44177/1/BikeSharing_EJOR_revised.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (23)
Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems ⋮ Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds ⋮ Sustainable operations ⋮ A heuristic algorithm for a single vehicle static bike sharing rebalancing problem ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Branch-and-cut for a 2-commodity flow relocation model with time constraints ⋮ Shared mobility systems ⋮ Stochastic optimization models for a bike-sharing problem with transshipment ⋮ Shared mobility systems: an updated survey ⋮ Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems ⋮ A two-phase heuristic approach to the bike repositioning problem ⋮ Data-Driven Rebalancing Methods for Bike-Share Systems ⋮ Optimizing large on-demand transportation systems through stochastic conic programming ⋮ A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Inventory rebalancing and vehicle routing in bike sharing systems ⋮ The evolution of a clogging sidewalk caused by a dockless bicycle-sharing system: a stochastic particles model ⋮ Decisions of closed-loop supply chain based on recycling effort and differential game ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem
Cites Work
- Unnamed Item
- The static bicycle relocation problem with demand intervals
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Inventory rebalancing and vehicle routing in bike sharing systems
- Bike sharing systems: solving the static rebalancing problem
- Fourier-Motzkin elimination and its dual
- Balancing the stations of a self service “bike hire” system
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
This page was built for publication: An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
