Demand-aware charger planning for electric vehicle sharing
Cars of the future have been predicted as shared and electric. There has been a rapid growth in electric vehicle (EV) sharing services worldwide in recent years. For EV-sharing platforms to excel, it is essential for them to offer private charging infrastructure for exclusive use that meets the char...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4732 https://ink.library.smu.edu.sg/context/sis_research/article/5735/viewcontent/kdd18_du.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-5735 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-57352020-01-16T10:45:01Z Demand-aware charger planning for electric vehicle sharing DU, Bowen TONG, Yongxin ZHOU, Zimu TAO, Qian ZHOU, Wenjun Cars of the future have been predicted as shared and electric. There has been a rapid growth in electric vehicle (EV) sharing services worldwide in recent years. For EV-sharing platforms to excel, it is essential for them to offer private charging infrastructure for exclusive use that meets the charging demand of their clients. Particularly, they need to plan not only the places to build charging stations, but also the amounts of chargers per station, to maximally satisfy the requirements on global charging coverage and local charging demand. Existing research efforts are either inapplicable for their different problem formulations or are at a coarse granularity. In this paper, we formulate the Electric Vehicle Charger Planning (EVCP) problem especially for EV-sharing. We prove that the EVCP problem is NP-hard, and design an approximation algorithm to solve the problem with a theoretical bound of 1 − 1 e . We also devise some optimization techniques to speed up the solution. Extensive experiments on real-world datasets validate the effectiveness and the efficiency of our proposed solutions. 2018-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4732 info:doi/10.1145/3219819.3220032 https://ink.library.smu.edu.sg/context/sis_research/article/5735/viewcontent/kdd18_du.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Electric Vehicles Location Selection Submodularity Electrical and Computer Engineering Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Electric Vehicles Location Selection Submodularity Electrical and Computer Engineering Software Engineering |
spellingShingle |
Electric Vehicles Location Selection Submodularity Electrical and Computer Engineering Software Engineering DU, Bowen TONG, Yongxin ZHOU, Zimu TAO, Qian ZHOU, Wenjun Demand-aware charger planning for electric vehicle sharing |
description |
Cars of the future have been predicted as shared and electric. There has been a rapid growth in electric vehicle (EV) sharing services worldwide in recent years. For EV-sharing platforms to excel, it is essential for them to offer private charging infrastructure for exclusive use that meets the charging demand of their clients. Particularly, they need to plan not only the places to build charging stations, but also the amounts of chargers per station, to maximally satisfy the requirements on global charging coverage and local charging demand. Existing research efforts are either inapplicable for their different problem formulations or are at a coarse granularity. In this paper, we formulate the Electric Vehicle Charger Planning (EVCP) problem especially for EV-sharing. We prove that the EVCP problem is NP-hard, and design an approximation algorithm to solve the problem with a theoretical bound of 1 − 1 e . We also devise some optimization techniques to speed up the solution. Extensive experiments on real-world datasets validate the effectiveness and the efficiency of our proposed solutions. |
format |
text |
author |
DU, Bowen TONG, Yongxin ZHOU, Zimu TAO, Qian ZHOU, Wenjun |
author_facet |
DU, Bowen TONG, Yongxin ZHOU, Zimu TAO, Qian ZHOU, Wenjun |
author_sort |
DU, Bowen |
title |
Demand-aware charger planning for electric vehicle sharing |
title_short |
Demand-aware charger planning for electric vehicle sharing |
title_full |
Demand-aware charger planning for electric vehicle sharing |
title_fullStr |
Demand-aware charger planning for electric vehicle sharing |
title_full_unstemmed |
Demand-aware charger planning for electric vehicle sharing |
title_sort |
demand-aware charger planning for electric vehicle sharing |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2018 |
url |
https://ink.library.smu.edu.sg/sis_research/4732 https://ink.library.smu.edu.sg/context/sis_research/article/5735/viewcontent/kdd18_du.pdf |
_version_ |
1770575014084476928 |