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

Abstract

ABSTRACT Nowadays, the significance of developing sustainable transport systems is being reconsidered due to the impact produced by an extensive use of private cars. In this scenario, bicycles are becoming more popular. To encourage cycling, bike-sharing systems have been developed. However, as safety is people’s main concern of cycling, bike-sharing systems should be part of an integral project that includes not only docking stations but a dedicated cycle path network connecting them. A two-stage stochastic programming model that maximizes the travel demand covered by the system is developed. Various demand scenarios in terms of different time periods of a day, travel intensities and levels of commuting demand are considered in the model, in order to obtain robust solutions. A real-world case study based on the city of Montevideo in Uruguay is conducted. The obtained solution shows that the model tends to develop bicycle lane network with good connectivity between transit stations and normal stations, and the obtained network possesses good robustness.