Location and Coverage Analysis of Bike-Sharing Stations in University Campus

被引:26
作者
Mete, Suleyman [1 ]
Cil, Zeynel Abidin [2 ]
Ozceylan, Eren [3 ]
机构
[1] Munzur Univ, Dept Ind Engn, Tunceli, Turkey
[2] Izmir Democracy Univ, Dept Ind Engn, Izmir, Turkey
[3] Gaziantep Univ, Dept Ind Engn, Gaziantep, Turkey
来源
BUSINESS SYSTEMS RESEARCH JOURNAL | 2018年 / 9卷 / 02期
关键词
Bike station; location-allocation; maximal covering; p-center; p-median; set covering; undesirable facility location;
D O I
10.2478/bsrj-2018-0021
中图分类号
F [经济];
学科分类号
02 ;
摘要
Background: Bike-sharing programmes have become popular in a large number of cities in order to facilitate bicycle use. Determining the location of bike sharing stations is vital to success of these programmes. Objectives: In this paper, a case study is applied to the Gaziantep University campus in order to find possible locations of the stations for users (students). The purpose is to minimize the total walking distance. Methods/Approach: Set and maximal covering mathematical models are considered to decide on coverage capability of determined 20 demand points and 20 potential bike stations. Then, the mathematical models of P-center and P-median are used to build possible stations and to allocate demand points to the opened stations. Finally, an undesirable facility location model is used to find the bike stations, which have the maximum distance from demand nodes, and to eliminate them. Results: In computational results, it is clearly seen that the proposed approaches set the potential bike station covering all demand points. They also provide different solutions for the campus planners. Conclusions: The methodology outlined in this study can provide university administrators with a useful insight into locations of stations, and in this way, it contributes significantly to future planning of bike-sharing systems.
引用
收藏
页码:80 / 95
页数:16
相关论文
共 25 条
[1]   A capacitated bike sharing location-allocation problem under demand uncertainty using sample average approximation: A greedy genetic-particle swarm optimization algorithm [J].
Ali-Askari, E. ;
Bashiri, M. ;
Tavakkoli-Moghaddam, R. .
SCIENTIA IRANICA, 2017, 24 (05) :2567-2580
[2]   AN ALGORITHM FOR SET COVERING PROBLEM [J].
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (01) :85-93
[3]   Where do cyclists ride? A route choice model developed with revealed preference GPS data [J].
Broach, Joseph ;
Dill, Jennifer ;
Gliebe, John .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2012, 46 (10) :1730-1740
[4]   Optimizing the location of stations in bike-sharing programs: A GIS approach [J].
Carlos Garcia-Palomares, Juan ;
Gutierrez, Javier ;
Latorre, Marta .
APPLIED GEOGRAPHY, 2012, 35 (1-2) :235-246
[5]  
Cetinkaya C, 2017, SIGMA J ENG NAT SCI, V35, P535
[6]  
Cohen A., 2014, BIKE SHARE PLANNING
[7]  
Croci E., 2014, BOCCONI WORKING PAPE, V68
[8]   What you should know about location modeling [J].
Daskin, Mark S. .
NAVAL RESEARCH LOGISTICS, 2008, 55 (04) :283-294
[9]   Optimal Placement of the Bike Rental Stations and Their Capacities in Olomouc [J].
Dobesova, Zdena ;
Hybner, Radek .
GEOINFORMATICS FOR INTELLIGENT TRANSPORTATION, 2015, :51-60
[10]   ANALYTICAL MODELS FOR LOCATING UNDESIRABLE FACILITIES [J].
ERKUT, E ;
NEUMAN, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (03) :275-291