Vehicle scheduling approach and its practice to optimise public bicycle redistribution in Hangzhou

Abstract

Public bicycle sharing programmes (PBSPs) have become increasingly popular across many urban areas in China. Hangzhou PBSP is the world's largest and forms this case study. The management of this large inventory of bicycles is a particularly challenging issue with the goal to ensure the demand for bicycles is met at all times across the network. To this end, an efficient scheduling approach is needed with the capacity to guide the redistribution of bicycles across the self-service stations. Drawing on 7 years of disaggregate trip data, this study first captures the usage dynamics across both space and time to extract the candidate stations and redistribution periods for vehicle scheduling. A region partition method with K-means clustering is proposed to satisfy the real-time requirement of large-scale PBSPs' redistribution. Moreover, drawing on the variations in demand a back-propagation neural network short-term prediction model is computed to inform the necessary prospective redistribution of bicycles to ensure demand is always met. Finally, a vehicle scheduling model employing a rolling horizon scheduling algorithm is established and implemented in a GIS-based prototype system. The prototype is evaluated through its effectiveness and found benefit for following 18 months of practical operation in Hangzhou PBSP.