Robust bike-sharing stations allocation and path network design: a two-stage stochastic programming model

2019 ◽  
Vol 12 (10) ◽  
pp. 682-691 ◽  
Author(s):  
Jian Gang Jin ◽  
Hugo Nieto ◽  
Linjun Lu
Keyword(s):  
Stochastic Programming ◽  
Network Design ◽  
Programming Model ◽  
Two Stage ◽  
Bike Sharing ◽  
Stochastic Programming Model

scholarly journals Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Qiong Tang ◽  
Zhuo Fu ◽  
Dezhi Zhang ◽  
Hao Guo ◽  
Minyi Li
Keyword(s):  
Stochastic Programming ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Two Stage ◽  
System A ◽  
Penalty Costs ◽  
Bike Sharing ◽  
Holding Cost ◽  
Stochastic Programming Model ◽  
Annealing Algorithm

In this paper, a bike repositioning problem with stochastic demand is studied. The problem is formulated as a two-stage stochastic programming model to optimize the routing and loading/unloading decisions of the repositioning truck at each station and depot under stochastic demands. The goal of the model is to minimize the expected total sum of the transportation costs, the expected penalty costs at all stations, and the holding cost of the depot. A simulated annealing algorithm is developed to solve the model. Numerical experiments are conducted on a set of instances from 20 to 90 stations to demonstrate the effectiveness of the solution algorithm and the accuracy of the proposed two-stage stochastic model.

Sign in / Sign up

Export Citation Format

Share Document