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 |
id |
ndltd-TW-102NKIT5682014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NKIT56820142019-05-15T21:22:26Z http://ndltd.ncl.edu.tw/handle/b43fzq Bicycle sharing station location problem-a case study of C-bike 公共自行車租賃站區位配置-以高雄市為例 Wen Chao 趙文 碩士 國立高雄第一科技大學 運籌管理研究所 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. Ta-hui Yang Chen-cheng Chen 楊大輝 陳珍珍 2014 學位論文 ; thesis 98 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立高雄第一科技大學 === 運籌管理研究所 === 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.
|
author2 |
Ta-hui Yang |
author_facet |
Ta-hui Yang Wen Chao 趙文 |
author |
Wen Chao 趙文 |
spellingShingle |
Wen Chao 趙文 Bicycle sharing station location problem-a case study of C-bike |
author_sort |
Wen Chao |
title |
Bicycle sharing station location problem-a case study of C-bike |
title_short |
Bicycle sharing station location problem-a case study of C-bike |
title_full |
Bicycle sharing station location problem-a case study of C-bike |
title_fullStr |
Bicycle sharing station location problem-a case study of C-bike |
title_full_unstemmed |
Bicycle sharing station location problem-a case study of C-bike |
title_sort |
bicycle sharing station location problem-a case study of c-bike |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/b43fzq |
work_keys_str_mv |
AT wenchao bicyclesharingstationlocationproblemacasestudyofcbike AT zhàowén bicyclesharingstationlocationproblemacasestudyofcbike AT wenchao gōnggòngzìxíngchēzūlìnzhànqūwèipèizhìyǐgāoxióngshìwèilì AT zhàowén gōnggòngzìxíngchēzūlìnzhànqūwèipèizhìyǐgāoxióngshìwèilì |
_version_ |
1719112144401727488 |