{"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.