A Comparison of Clustering Method to Determine Depot Location for a Bike-sharing Operation

Kanokporn Boonjubut, H. Hasegawa
{"title":"A Comparison of Clustering Method to Determine Depot Location for a Bike-sharing Operation","authors":"Kanokporn Boonjubut, H. Hasegawa","doi":"10.1109/ACMLC58173.2022.00030","DOIUrl":null,"url":null,"abstract":"Bike-sharing schemes have become a popular and environmentally friendly transportation mode. This paper focuses on imbalances caused by problems with insufficient bikes or docking stations in such schemes, which lead to operating costs in terms of total distance due to the need to relocate bikes. Here, a method is proposed, based on cluster analysis, for considering depot location in bike-sharing schemes. The main objective is to reduce operating costs by minimizing the total distance required for relocating bikes. First, a method for predicting demand for bikes is presented. Then, the K-means and WK-means are compared to determine the number and location of depots. The last step is to use this method to compare the total distance required for different depot location options. The results indicate that the proposed method performs well in terms of reducing the total distance required.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"44 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACMLC58173.2022.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Bike-sharing schemes have become a popular and environmentally friendly transportation mode. This paper focuses on imbalances caused by problems with insufficient bikes or docking stations in such schemes, which lead to operating costs in terms of total distance due to the need to relocate bikes. Here, a method is proposed, based on cluster analysis, for considering depot location in bike-sharing schemes. The main objective is to reduce operating costs by minimizing the total distance required for relocating bikes. First, a method for predicting demand for bikes is presented. Then, the K-means and WK-means are compared to determine the number and location of depots. The last step is to use this method to compare the total distance required for different depot location options. The results indicate that the proposed method performs well in terms of reducing the total distance required.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种聚类方法在共享单车运营中确定仓库位置的比较
自行车共享计划已经成为一种流行的环保交通方式。本文关注的是此类方案中由于自行车或停靠站不足而导致的不平衡问题,由于需要重新安置自行车而导致总距离上的运营成本。在此,提出了一种基于聚类分析的方法来考虑共享单车方案中的车辆段位置。其主要目标是通过最小化重新安置自行车所需的总距离来降低运营成本。首先,提出了一种预测自行车需求的方法。然后,比较K-means和WK-means来确定仓库的数量和位置。最后一步是使用这种方法来比较不同仓库位置选项所需的总距离。结果表明,所提出的方法在减少所需总距离方面表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Data-Driven Pricing Strategy for Automobile Insurance Policies An Evolutionary Strategy Based Training Optimization of Supervised Machine Learning Algorithms (EStoTimeSMLAs) Copyright Page Integrated Age Estimation Mechanism based on Decision-Level Fusion of Error and Deviation Orientation Model Application of PRA and Machine Learning Algorithm in Budget Data Acquisition and Processing System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1