Stochastic optimization models for a bike-sharing problem with transshipment
From MaRDI portal
Recommendations
- 2-level station location for bike sharing
- Robust multi-period fleet allocation models for bike-sharing systems
- Cost-efficient allocation of bikes to stations in bike sharing systems
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
Cites work
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- Analyzing the quality of the expected value solution in stochastic programming
- Evaluation of scenario generation methods for stochastic programming
- Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
- Introduction to stochastic programming.
- Modeling with stochastic programming.
- Robust multi-period fleet allocation models for bike-sharing systems
- Shared mobility systems: an updated survey
- The static bicycle relocation problem with demand intervals
Cited in
(19)- 2-level station location for bike sharing
- Repositioning with unreliable carriers: the case of marine chassis equipment at container ports
- Transition towards sustainable mobility: the role of transport optimization
- A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS
- Joint optimization of the inventory routing problem considering the recycling of broken bikes in the bike-sharing system
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- A discrete model for bike share inventory
- Robust multi-period fleet allocation models for bike-sharing systems
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem
- Bike rebalancing: how to find a balanced matching in the k center problem?
- To outsource or not: bike-share rebalancing strategies under the service quality deviation of a third party
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Minimizing multimodular functions and allocating capacity in bike-sharing systems
- The value of the right distribution in stochastic programming with application to a Newsvendor problem
- The static bicycle relocation problem with demand intervals
- The static bike relocation problem with multiple vehicles and visits
- Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems
This page was built for publication: Stochastic optimization models for a bike-sharing problem with transshipment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728505)
