Bicycle sharing station location problem-a case study of C-bike
碩士 === 國立高雄第一科技大學 === 運籌管理研究所 === 102 === This paper focus on the allocation of the bicycle sharing stations in Kaohsiung city (called C-bike). The location of bicycle sharing stations plays a main role of the bicycle sharing plans. The demand nods and station candidate are set according to differen...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/b43fzq |
| Summary: | 碩士 === 國立高雄第一科技大學 === 運籌管理研究所 === 102 === This paper focus on the allocation of the bicycle sharing stations in Kaohsiung city (called C-bike). The location of bicycle sharing stations plays a main role of the bicycle sharing plans. The demand nods and station candidate are set according to different features of areas. We use two models to formulate minimum station candidates on 100% coverage demand (Set Covering Problem) and maximum coverage on limiting the number of station candidates (Maximal Covering Location Problem). By using TransCAD and GAMS to solve the problems and perform sensitivity analysis, we discover that the results of different models can be used for the location planning of bicycle sharing stations in Kaohsiung city. Average allocation of Set Covering Problem model is better for the area of spare demand nods. The results of Maximal Covering Location Problem is better for the area of intension demand nods, because few decided candidates cover most demands.
|
|---|