The static bicycle relocation problem with demand intervals
DOI10.1016/J.EJOR.2014.04.013zbMATH Open1338.90264OpenAlexW2052997156MaRDI QIDQ296779FDOQ296779
Authors: Güneş Erdogăn, G. Laporte, Roberto Wolfler Calvo 
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/367453/1/bike_repositioning_post_refereeing.pdf
Recommendations
- The static bike relocation problem with multiple vehicles and visits
- The vehicle routing problem with load-dependent travel times for cargo bicycles
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Bike sharing systems: solving the static rebalancing problem
- A two-phase heuristic approach to the bike repositioning problem
- Inventory rebalancing and vehicle routing in bike sharing systems
- Stochastic optimization models for a bike-sharing problem with transshipment
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Bike sharing systems: solving the static rebalancing problem
- Inventory rebalancing and vehicle routing in bike sharing systems
- Balancing the stations of a self service ``bike hire system
- Equilibrium network design of shared-vehicle systems
- A branch-and-cut algorithm for the preemptive swapping problem
- The swapping problem
- The Covering Tour Problem
- A branch-and-cut algorithm for the nonpreemptive swapping problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Heuristics for the mixed swapping problem
- Facet identification for the symmetric traveling salesman polytope
Cited In (18)
- Repositioning with unreliable carriers: the case of marine chassis equipment at container ports
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- Bike rebalancing: how to find a balanced matching in the k center problem?
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Shared mobility systems: an updated survey
- Data-driven rebalancing methods for bike-share systems
- The one-station bike repositioning problem
- Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- The static bike relocation problem with multiple vehicles and visits
- Stochastic optimization models for a bike-sharing problem with transshipment
- Shared mobility systems
- A two-phase heuristic approach to the bike repositioning problem
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
This page was built for publication: The static bicycle relocation problem with demand intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296779)
