An Optimization Deployment Scheme for Static Charging Piles Based on Dynamic of Shared E-Bikes

Ping Zhong, Aikun Xu, Yuanming Chen, Feng Gao, Guihua Duan
{"title":"An Optimization Deployment Scheme for Static Charging Piles Based on Dynamic of Shared E-Bikes","authors":"Ping Zhong, Aikun Xu, Yuanming Chen, Feng Gao, Guihua Duan","doi":"10.1109/MSN48538.2019.00071","DOIUrl":null,"url":null,"abstract":"Shared e-bikes are popular because of their green, eco-friendly and efficient features. Due to the limited battery capacity of the e-bikes, the energy problem has become one of the main factors limiting its further development. The energy problem can be solved by using static charging piles (SCP) to replenish the batteries of shared e-bike. The location of the shared e-bike is time-varying, resulting in the optimal deployment of SCP as a complex location problem. In this paper, we propose an optimal Deployment algorithm for Maximum Coverage combined the Dynamic Changes of nodes (max-DCDC) based on the known number of SCP. This method first quantitatively analyzes the dynamic change process of the shared e-bike to reduce the deployment scope of the SCP. Then, according to the geometric characteristics of the e-bike distribution within the deployment scope to optimizes the deployment location of the SCP. Simulation experiments show that max-DCDC has better performance in terms of deployment stability and e-bike coverage compared with the other algorithms.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN48538.2019.00071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Shared e-bikes are popular because of their green, eco-friendly and efficient features. Due to the limited battery capacity of the e-bikes, the energy problem has become one of the main factors limiting its further development. The energy problem can be solved by using static charging piles (SCP) to replenish the batteries of shared e-bike. The location of the shared e-bike is time-varying, resulting in the optimal deployment of SCP as a complex location problem. In this paper, we propose an optimal Deployment algorithm for Maximum Coverage combined the Dynamic Changes of nodes (max-DCDC) based on the known number of SCP. This method first quantitatively analyzes the dynamic change process of the shared e-bike to reduce the deployment scope of the SCP. Then, according to the geometric characteristics of the e-bike distribution within the deployment scope to optimizes the deployment location of the SCP. Simulation experiments show that max-DCDC has better performance in terms of deployment stability and e-bike coverage compared with the other algorithms.
基于动态的共享电动自行车静态充电桩优化配置方案
共享电动自行车因其绿色、环保和高效的特点而广受欢迎。由于电动自行车的电池容量有限,能源问题已成为制约其进一步发展的主要因素之一。利用静态充电桩(SCP)为共享电动自行车的电池充电可以解决能源问题。共享电动车的位置是时变的,使得SCP的最优部署成为一个复杂的定位问题。本文提出了一种基于已知SCP数量的最大覆盖结合节点动态变化的最优部署算法(max-DCDC)。该方法首先定量分析了共享电动自行车的动态变化过程,减小了SCP的部署范围。然后,根据部署范围内电动自行车分布的几何特征,对SCP的部署位置进行优化。仿真实验表明,与其他算法相比,max-DCDC在部署稳定性和电动自行车覆盖方面具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信