Bike rebalancing: how to find a balanced matching in the k center problem?
From MaRDI portal
Publication:6565428
DOI10.1016/J.EJOR.2024.03.009MaRDI QIDQ6565428
Yu-Hao Zhang, Guochuan Zhang, Jinxiang Gan
Publication date: 2 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The static bicycle relocation problem with demand intervals
- A destroy and repair algorithm for the bike sharing rebalancing problem
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Centrality of trees for capacitated \(k\)-center
- Clustering to minimize the maximum intercluster distance
- 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: an updated survey
- Inventory rebalancing and vehicle routing in bike sharing systems
- Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- Equilibrium network design of shared-vehicle systems
- Bike sharing systems: solving the static rebalancing problem
- Algorithms for capacitated vehicle routing
- Balancing the stations of a self service “bike hire” system
- A Best Possible Heuristic for the k-Center Problem
- Approximating Capacitated Routing and Delivery Problems
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Capacitated k-Center Problem with Vertex Weights
This page was built for publication: Bike rebalancing: how to find a balanced matching in the k center problem?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565428)
