Stochastic optimization models for a bike-sharing problem with transshipment
From MaRDI portal
Publication:1728505
DOI10.1016/j.ejor.2018.12.031zbMath1430.90107OpenAlexW2905631454WikidataQ128671686 ScholiaQ128671686MaRDI QIDQ1728505
Matteo Cagnolari, Francesca Maggioni, Stein W. Wallace, Luca Bertazzi
Publication date: 25 February 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.031
Related Items
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem, To outsource or not: bike-share rebalancing strategies under the service quality deviation of a third party, Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems, The value of the right distribution in stochastic programming with application to a Newsvendor problem, A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
Cites Work
- Unnamed Item
- Unnamed Item
- The static bicycle relocation problem with demand intervals
- An exact algorithm for the static rebalancing problem arising in bicycle sharing systems
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- Shared mobility systems: an updated survey
- Analyzing the quality of the expected value solution in stochastic programming
- Robust multi-period fleet allocation models for bike-sharing systems
- Modeling with Stochastic Programming
- Introduction to Stochastic Programming
- Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition