Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/95448
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Civil and Environmental Engineering | en_US |
dc.creator | Chen, XW | en_US |
dc.creator | Chen, BY | en_US |
dc.creator | Lam, WHK | en_US |
dc.creator | Tam, ML | en_US |
dc.creator | Ma, W | en_US |
dc.date.accessioned | 2022-09-19T02:02:03Z | - |
dc.date.available | 2022-09-19T02:02:03Z | - |
dc.identifier.issn | 0957-4174 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/95448 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | © 2021 Elsevier Ltd. All rights reserved. | en_US |
dc.rights | © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. | en_US |
dc.rights | The following publication Chen, X.-W., et al. (2021). "A bi-objective reliable path-finding algorithm for battery electric vehicle routing." Expert Systems with Applications 182: 115228 is available at https://dx.doi.org/10.1016/j.eswa.2021.115228. | en_US |
dc.subject | Bi-objective path finding | en_US |
dc.subject | Energy consumption reliability | en_US |
dc.subject | Network uncertainties | en_US |
dc.subject | Travel time reliability | en_US |
dc.title | A bi-objective reliable path-finding algorithm for battery electric vehicle routing | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 182 | en_US |
dc.identifier.doi | 10.1016/j.eswa.2021.115228 | en_US |
dcterms.abstract | This paper proposes a bi-objective reliable path-finding algorithm for routing battery electric vehicles on a road network, with vehicles’ energy consumption uncertainty and travel time uncertainty. A bi-objective stochastic optimization problem is proposed and formulated to simultaneously maximize energy consumption reliability (ECR) and travel time reliability (TTR). ECR is defined as the probability of finishing a trip without exhausting a given battery energy budget, while TTR is the on-time arrival probability with the travel time budget. In this study, the proposed optimization problem is decomposed into two sub-problems: (1) finding K most reliable paths for maximizing the TTR objective and (2) finding the most reliable path for optimizing the ECR objective. Then, a novel ranking algorithm is proposed to exactly solve the formulated optimization problem. A case study is carried out on Hong Kong's road network to demonstrate the efficacy and efficiency of the proposed algorithm for real-world applications. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Expert systems with applications, 11 Nov. 2021, v. 182, 115228 | en_US |
dcterms.isPartOf | Expert systems with applications | en_US |
dcterms.issued | 2021-11-11 | - |
dc.identifier.scopus | 2-s2.0-85106465326 | - |
dc.identifier.eissn | 1873-6793 | en_US |
dc.identifier.artn | 115228 | en_US |
dc.description.validate | 202209 bcfc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | CEE-0082 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Key Research and Development Program; Dean's Reserve of the Hong Kong PolyU; NSF (Hubei Province) | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 52136207 | - |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Chen_Bi-Objective_Reliable_Path-Finding.pdf | Pre-Published version | 1.84 MB | Adobe PDF | View/Open |
Page views
75
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
50
Citations as of Oct 13, 2024
SCOPUSTM
Citations
21
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
18
Citations as of Oct 17, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.