The static bicycle relocation problem with demand intervals

DOI10.1016/J.EJOR.2014.04.013zbMath1338.90264OpenAlexW2052997156MaRDI QIDQ296779

Gilbert Laporte, Roberto Wolfler Calvo, Güneş Erdoğan

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

zbMATH Keywords

traveling salesmanbranch-and-cutpickup and delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (18)

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 ⋮ 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 ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ 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 ⋮ The one-station bike repositioning problem ⋮ A two-phase heuristic approach to the bike repositioning problem ⋮ Data-Driven Rebalancing Methods for Bike-Share Systems ⋮ Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station ⋮ Repositioning with unreliable carriers: the case of marine chassis equipment at container ports ⋮ Bike rebalancing: how to find a balanced matching in the k center problem? ⋮ A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems

Cites Work

• Unnamed Item
• 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
• Inventory rebalancing and vehicle routing in bike sharing systems
• Equilibrium network design of shared-vehicle systems
• Bike sharing systems: solving the static rebalancing problem
• A branch-and-cut algorithm for the preemptive swapping problem
• Balancing the stations of a self service “bike hire” system
• 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

This page was built for publication: The static bicycle relocation problem with demand intervals