TY - GEN
T1 - A Stochastic Maximal Covering Formulation for a Bike Sharing System
AU - Ciancio, Claudio
AU - Ambrogio, Giuseppina
AU - Laganá, Demetrio
PY - 2017/1/1
Y1 - 2017/1/1
N2 - This paper discusses a maximal covering approach for bike sharing systems under deterministic and stochastic demand. Bike sharing is constantly becoming a more popular and sustainable alternative transportation system. One of the most important elements for the design of a successful bike sharing system is given by the location of stations and bikes. The demands in each zone for each period is however uncertain and can only be estimated. Therefore, it is necessary to address this problem by taking into account the stochastic features of the problem. The proposed model determines the optimal location of bike stations, and the number of bikes located initially in each station, considering an initial investment lower than a given predetermined budget. The objective of the model is to maximize the percentage of covered demand. Moreover, during the time horizon, it is possible to relocate a certain amount of bikes in different stations with a cost proportional to the traveled distance. Both deterministic and stochastic models are formulated as mixed integer linear programs.
AB - This paper discusses a maximal covering approach for bike sharing systems under deterministic and stochastic demand. Bike sharing is constantly becoming a more popular and sustainable alternative transportation system. One of the most important elements for the design of a successful bike sharing system is given by the location of stations and bikes. The demands in each zone for each period is however uncertain and can only be estimated. Therefore, it is necessary to address this problem by taking into account the stochastic features of the problem. The proposed model determines the optimal location of bike stations, and the number of bikes located initially in each station, considering an initial investment lower than a given predetermined budget. The objective of the model is to maximize the percentage of covered demand. Moreover, during the time horizon, it is possible to relocate a certain amount of bikes in different stations with a cost proportional to the traveled distance. Both deterministic and stochastic models are formulated as mixed integer linear programs.
KW - Bike sharing system
KW - Stochastic model
UR - http://www.scopus.com/inward/record.url?scp=85034224482&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034224482&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-67308-0_26
DO - 10.1007/978-3-319-67308-0_26
M3 - Conference contribution
AN - SCOPUS:85034224482
SN - 9783319673073
T3 - Springer Proceedings in Mathematics and Statistics
SP - 257
EP - 265
BT - Optimization and Decision Science
A2 - Sforza, Antonio
A2 - Sterle, Claudio
PB - Springer New York LLC
T2 - International Conference on Optimization and Decision Science, ODS 2017
Y2 - 4 September 2017 through 7 September 2017
ER -