Balancing the stations of a self service ``bike hire system

DOI10.1051/RO/2011102MaRDI QIDQ3016180zbMATHOpenAlexFDO

Authors Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche, Frédéric Meunier, Ludovic Robinet

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

zbMATH Keywords

approximation algorithmrouting problemself service transport system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Bike sharing systems: solving the static 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
• Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1953194 (Why is no real title available?)
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Algorithms and Computation
• Algorithms for capacitated vehicle routing
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximating Capacitated Routing and Delivery Problems
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Separating capacity constraints in the CVRP using tabu search
• The swapping problem

Cited in

(26)

• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• Branch-and-cut for a 2-commodity flow relocation model with time constraints
• Shared mobility systems: an updated survey
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
• A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS
• A two-phase heuristic approach to the bike repositioning problem
• Bike sharing systems: solving the static rebalancing problem
• The one-station bike repositioning problem
• Data-driven rebalancing methods for bike-share systems
• Shared mobility systems
• A project and lift approach for a 2-commodity flow relocation model in a time expanded network
• An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
• 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
• The dynamic bowser routing problem
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• Regulating vehicle sharing systems through parking reservation policies: analysis and performance bounds
• Bike rebalancing: how to find a balanced matching in the k center problem?
• A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem
• Inventory rebalancing and vehicle routing in bike sharing systems
• The static bicycle relocation problem with demand intervals
• A destroy and repair algorithm for the bike sharing rebalancing problem
• Inventory rebalancing through pricing in public bike sharing systems
• The static bike relocation problem with multiple vehicles and visits
• Balancing bike sharing systems with constraint programming
• Large neighborhood search for the bike request scheduling problem

This page was built for publication: Balancing the stations of a self service ``bike hire system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016180)