Station Location Optimization for the One-Way Carsharing System: Modeling and a Case Study

Abstract

Carsharing is regarded as a new mode of transportation that can meet the diversity of travel demands. Carsharing systems have different operating modes, and one-way systems are more widely used since cars can be dropped off at any station. However, their planning involves a series of joint decisions regarding the number, size, and location of stations, as well as the fleet size. This paper develops a data-driven mixed-integer linear programming (MILP) model for planning one-way carsharing systems that consider the spatial distribution of demand and the interacting decisions between stations. The characteristics of existing stations and their spatiotemporal correlations are an important part of the model. To solve the MILP model, the extension of the Benders decomposition algorithm is adopted. The practicality of the proposed approach is demonstrated in a case study in Beijing, China. The results show that the existing planning of carsharing could result in a serious waste of resources. In contrast, the proposed method can obtain effective results in a reasonable time. The location results corresponding to a different rate of satisfied demand show that increasing the parking spots to improve the interaction between stations can effectively reduce the cost of operations. It should be noted that this paper only considers the benefit of operators. Future works will be carried out to optimize the one-way carsharing system by considering the benefits of operators, as well as the benefits of users and society. In addition, the impact of COVID-19 will be taken into account in future modeling and case studies.