Shortest feasible paths with partial charging for battery-powered electric vehicles in smart cities
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Ying | - |
dc.contributor.author | Aliya, Baltabay | - |
dc.contributor.author | Zhou, Yutong | - |
dc.contributor.author | You, Ilsun | - |
dc.contributor.author | Zhang, Xin | - |
dc.contributor.author | Pau, Giovanni | - |
dc.contributor.author | Collotta, Mario | - |
dc.date.accessioned | 2021-08-11T11:43:40Z | - |
dc.date.available | 2021-08-11T11:43:40Z | - |
dc.date.issued | 2018-10 | - |
dc.identifier.issn | 1574-1192 | - |
dc.identifier.issn | 1873-1589 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/5599 | - |
dc.description.abstract | The problem of minimizing the overall travel time, considering the one spent at charging stations, with the aim to improve the cruising range for Electric Vehicles (EVs) in road networks, is examined in this paper. Since the battery capacity of EVs is limited, it is inevitable for them to stop at charging stations. As they are lacking and the recharging process is time-consuming, an efficient route planning is essential. This paper extends a previously presented approach, i.e., EVRC (Electric Vehicle Route Planning with Recharging). In detail, the solution presented in this work considers a set of factors into account simultaneously and introduces a functional approach that estimates time-optimal routes for road networks with realistic models of charging stops. The key features include the efficient computation of the recharging station's locations, the battery charging amount under a partial charging scheme, the nonlinear charging functions, and the service time duration at recharging stations. The experimental results highlight that the proposed approach outperforms other similar methods in facing the same problem. The extensive experimental evaluations show that refusing partial charging and neglecting nonlinear charging, as well as servicing time, may generate some infeasible or too costly solutions. (C) 2018 Elsevier B.V. All rights reserved. | - |
dc.format.extent | 12 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Shortest feasible paths with partial charging for battery-powered electric vehicles in smart cities | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.pmcj.2018.08.001 | - |
dc.identifier.scopusid | 2-s2.0-85053052940 | - |
dc.identifier.wosid | 000447436700005 | - |
dc.identifier.bibliographicCitation | Pervasive and Mobile Computing, v.50, pp 82 - 93 | - |
dc.citation.title | Pervasive and Mobile Computing | - |
dc.citation.volume | 50 | - |
dc.citation.startPage | 82 | - |
dc.citation.endPage | 93 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | ROUTING PROBLEM | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Route planning | - |
dc.subject.keywordAuthor | Electric vehicles | - |
dc.subject.keywordAuthor | Charging stations | - |
dc.subject.keywordAuthor | Partial charging | - |
dc.subject.keywordAuthor | Energy consumption | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.