{"title":"Station segmentation of Hangzhou public free-bicycle system based on improved randomized algorithm","authors":"Hao Wu, Xujian Fang, Haitao Xu","doi":"10.1109/ICMLC.2011.6017022","DOIUrl":null,"url":null,"abstract":"In order to cope with \"the last kilometer to end a transit trip\", hence to ease traffic and parking difficulties, and to boost a sustainable green transportation system, this paper focuses on a bike sharing program implemented in Hangzhou, Zhejiang. There are many and many technology problems in the decision of intelligent dispatch. In this paper, we consider a special case of the system, it is to segment the stations into two sections. An improved randomized algorithm is proposed to do it. After analysis on the performance of algorithm, the result is 0.6378 and better that the trivial case of 0.5.","PeriodicalId":228516,"journal":{"name":"2011 International Conference on Machine Learning and Cybernetics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Machine Learning and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2011.6017022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In order to cope with "the last kilometer to end a transit trip", hence to ease traffic and parking difficulties, and to boost a sustainable green transportation system, this paper focuses on a bike sharing program implemented in Hangzhou, Zhejiang. There are many and many technology problems in the decision of intelligent dispatch. In this paper, we consider a special case of the system, it is to segment the stations into two sections. An improved randomized algorithm is proposed to do it. After analysis on the performance of algorithm, the result is 0.6378 and better that the trivial case of 0.5.