An Optimization Deployment Scheme for Static Charging Piles Based on Dynamic of Shared E-Bikes
| Autor: | Yuanming Chen, Feng Gao, Ping Zhong, Aikun Xu, Guihua Duan |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Scheme (programming language)
Scope (project management) Computer science Distributed computing 020208 electrical & electronic engineering ComputingMilieux_PERSONALCOMPUTING Process (computing) Stability (learning theory) 020206 networking & telecommunications Topology (electrical circuits) 02 engineering and technology Software deployment 0202 electrical engineering electronic engineering information engineering Wireless sensor network computer Energy (signal processing) computer.programming_language |
| Zdroj: | MSN |
| DOI: | 10.1109/msn48538.2019.00071 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|