Optimizing the location-allocation problem of bike sharing stations: A case study in gaziantep university campus

A growing number of cities are implementing bike-sharing programs to increase bicycle use. One of the key factors for the success of such programs is the location of bike stations in relation to potential demand. In this paper, potential locations of bike sharing stations in Gaziantep University campus are investigated to provide optimal utilization for users. To do so, first of all, 20 demand points and 20 potential bike stations are determined. Second, set covering mathematical model is handled to determine coverage capability of potential bike stations. Finally, P-center and P-median mathematical models are applied to set up potential stations and to assign demand points to the opened stations so that the total walking distance can be minimized. Computational experiments prove that our approach can find new potential bike stations which cover all demand points.