基于改进随机化算法的杭州公共免费自行车系统站点分割

Hao Wu, Xujian Fang, Haitao Xu
{"title":"基于改进随机化算法的杭州公共免费自行车系统站点分割","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":"{\"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}","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

摘要

为了解决“公交出行最后一公里”的问题,从而缓解交通和停车困难,促进可持续的绿色交通系统,本文以浙江杭州的共享单车项目为研究对象。智能调度决策中存在着许多技术问题。本文考虑系统的一种特殊情况,即将车站划分为两段。提出了一种改进的随机化算法。经过对算法性能的分析,结果为0.6378,优于0.5的平凡情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Station segmentation of Hangzhou public free-bicycle system based on improved randomized algorithm
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信