學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Optimal Routing for Electric Vehicle Charging Systems with Stochastic Demand: A Heavy Traffic Approximation Approach
作者 洪英超
Hung, Ying-Chao
Lok, Horace PakHai
Michailidis, George
貢獻者 統計系
關鍵詞 Routing;Electric vehicle;Mean response time;Heavy traffic approximation;Convex optimization
日期 2021-06
上傳時間 2022-04-12
摘要 We consider a general electric vehicle (EV) charging system with stochastic demand, demand request locations, and predetermined charging facilities (including charging station locations and charger capacities). The objective is to design a good routing strategy that accommodates well demand-request dynamics so as to satisfy the charging system’s stability constraints and also minimize the EV’s mean response time. We introduce a class of flexible and measurement-based routing policies called “partition-based random routing” (PBRR) and show that the performance measure of interest can be formulated as a constrained optimization problem with a convex objective function when the system is heavily loaded. This formulation enables us to establish strong theoretical results that are in aid of finding the optimal routing solution; however, in practice, finding this solution requires rather involved numerical calculations. To that end, we propose a surrogate, easy to design and implement, optimization algorithm for finding the desired optimal routing solution. Numerical work based on synthetic data shows that the performance of the developed routing strategy and its fast implementation is highly satisfactory for a number of system settings.
關聯 European Journal of Operational Research, 299(2), 526-541
資料類型 article
DOI https://doi.org/10.1016/j.ejor.2021.06.058
dc.contributor 統計系
dc.creator (作者) 洪英超
dc.creator (作者) Hung, Ying-Chao
dc.creator (作者) Lok, Horace PakHai
dc.creator (作者) Michailidis, George
dc.date (日期) 2021-06
dc.date.accessioned 2022-04-12-
dc.date.available 2022-04-12-
dc.date.issued (上傳時間) 2022-04-12-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/139850-
dc.description.abstract (摘要) We consider a general electric vehicle (EV) charging system with stochastic demand, demand request locations, and predetermined charging facilities (including charging station locations and charger capacities). The objective is to design a good routing strategy that accommodates well demand-request dynamics so as to satisfy the charging system’s stability constraints and also minimize the EV’s mean response time. We introduce a class of flexible and measurement-based routing policies called “partition-based random routing” (PBRR) and show that the performance measure of interest can be formulated as a constrained optimization problem with a convex objective function when the system is heavily loaded. This formulation enables us to establish strong theoretical results that are in aid of finding the optimal routing solution; however, in practice, finding this solution requires rather involved numerical calculations. To that end, we propose a surrogate, easy to design and implement, optimization algorithm for finding the desired optimal routing solution. Numerical work based on synthetic data shows that the performance of the developed routing strategy and its fast implementation is highly satisfactory for a number of system settings.
dc.format.extent 2693581 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) European Journal of Operational Research, 299(2), 526-541
dc.subject (關鍵詞) Routing;Electric vehicle;Mean response time;Heavy traffic approximation;Convex optimization
dc.title (題名) Optimal Routing for Electric Vehicle Charging Systems with Stochastic Demand: A Heavy Traffic Approximation Approach
dc.type (資料類型) article
dc.identifier.doi (DOI) 10.1016/j.ejor.2021.06.058
dc.doi.uri (DOI) https://doi.org/10.1016/j.ejor.2021.06.058