Bike sharing systems: solving the static rebalancing problem
From MaRDI portal
Publication:2445841
DOI10.1016/j.disopt.2012.11.005zbMath1284.90040OpenAlexW2054274567MaRDI QIDQ2445841
Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo
Publication date: 15 April 2014
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.11.005
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items (40)
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 ⋮ An optimization framework for the development of efficient one-way car-sharing systems ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems ⋮ An exact algorithm for the static rebalancing problem arising in bicycle sharing systems ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds ⋮ On the online min-wait relocation problem ⋮ 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 ⋮ Design of a public bicycle-sharing system with safety ⋮ Measures of balance in combinatorial optimization ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem ⋮ 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 ⋮ Large neighborhood search for the bike request scheduling problem ⋮ A transient symmetry analysis for the \(M/M/1/k\) queue ⋮ Branch-and-cut for a 2-commodity flow relocation model with time constraints ⋮ Shared mobility systems ⋮ Empty-Car Routing in Ridesharing Systems ⋮ Bike sharing systems: solving the static rebalancing problem ⋮ 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 ⋮ 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 ⋮ Inventory rebalancing through pricing in public bike sharing systems ⋮ Decisions of closed-loop supply chain based on recycling effort and differential game ⋮ A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ A dual hesitant fuzzy rough pattern recognition approach based on deviation theories and its application in urban traffic modes recognition ⋮ An optimal stopping policy for car rental businesses with purchasing customers ⋮ Two-choice regulation in heterogeneous closed networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Separating capacity constraints in the CVRP using tabu search
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Branching rules revisited
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- 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
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Bike sharing systems: solving the static rebalancing problem
