基于动态规划的电动汽车向电网隔离区域输送电力的路径规划算法

IF 0.8 Q4 ROBOTICS
Yu Zhang, Wenjing Cao, Hanqing Zhao, Shuang Gao
{"title":"基于动态规划的电动汽车向电网隔离区域输送电力的路径规划算法","authors":"Yu Zhang,&nbsp;Wenjing Cao,&nbsp;Hanqing Zhao,&nbsp;Shuang Gao","doi":"10.1007/s10015-023-00879-7","DOIUrl":null,"url":null,"abstract":"<div><p>In this study, we considered the electric power delivery problem when using electric vehicles (EVs) for multiple households located in a remote region or a region isolated by disasters. Two optimization problems are formulated and compared; they yield the optimal routes that minimize the overall traveling distance of the EVs and their overall electric power consumption, respectively. We assume that the number of households requiring power delivery and the number of EVs used for power delivery in the region are given constants. Subsequently, we divide the households into groups and assign the households in each group to one EV. Each EV is required to return to its initial position after delivering electric power to all the households in the assigned group. In the first method, the benchmark method, the optimal route that minimizes the overall traveling distance of all the EVs is determined using the dynamic programming method. However, owing to traffic congestion on the roads, the optimal path that minimizes the overall traveling distance of all the EVs does not necessarily yield their minimum overall electric power consumption. In this study, to directly minimize the overall electric power consumption of all the considered EVs, we propose an optimization method that considers traffic congestion. Therefore, a second method is proposed, which minimizes the overall electric power consumption considering traffic congestion. The electric power consumed during the travel of each EV is calculated as a function of the length of each road section and the nominal average speed of vehicles on the road section. A case study in which four EVs are assigned to deliver electric power to serve eight households is conducted to validate the proposed method. To verify the effectiveness of the proposed method, the calculation results considering traffic congestion are compared with the benchmark method results, which minimizes the traveling distance. The comparison of the results from the two different methods shows that the optimal solution for the proposed method reduces the overall electric power consumption of all the EVs by 236.5(kWh) (9.4%) compared with the benchmark method. Therefore, the proposed method is preferable for the reduction of the overall electric power consumption of EVs.</p></div>","PeriodicalId":46050,"journal":{"name":"Artificial Life and Robotics","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Route planning algorithm based on dynamic programming for electric vehicles delivering electric power to a region isolated from power grid\",\"authors\":\"Yu Zhang,&nbsp;Wenjing Cao,&nbsp;Hanqing Zhao,&nbsp;Shuang Gao\",\"doi\":\"10.1007/s10015-023-00879-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this study, we considered the electric power delivery problem when using electric vehicles (EVs) for multiple households located in a remote region or a region isolated by disasters. Two optimization problems are formulated and compared; they yield the optimal routes that minimize the overall traveling distance of the EVs and their overall electric power consumption, respectively. We assume that the number of households requiring power delivery and the number of EVs used for power delivery in the region are given constants. Subsequently, we divide the households into groups and assign the households in each group to one EV. Each EV is required to return to its initial position after delivering electric power to all the households in the assigned group. In the first method, the benchmark method, the optimal route that minimizes the overall traveling distance of all the EVs is determined using the dynamic programming method. However, owing to traffic congestion on the roads, the optimal path that minimizes the overall traveling distance of all the EVs does not necessarily yield their minimum overall electric power consumption. In this study, to directly minimize the overall electric power consumption of all the considered EVs, we propose an optimization method that considers traffic congestion. Therefore, a second method is proposed, which minimizes the overall electric power consumption considering traffic congestion. The electric power consumed during the travel of each EV is calculated as a function of the length of each road section and the nominal average speed of vehicles on the road section. A case study in which four EVs are assigned to deliver electric power to serve eight households is conducted to validate the proposed method. To verify the effectiveness of the proposed method, the calculation results considering traffic congestion are compared with the benchmark method results, which minimizes the traveling distance. The comparison of the results from the two different methods shows that the optimal solution for the proposed method reduces the overall electric power consumption of all the EVs by 236.5(kWh) (9.4%) compared with the benchmark method. Therefore, the proposed method is preferable for the reduction of the overall electric power consumption of EVs.</p></div>\",\"PeriodicalId\":46050,\"journal\":{\"name\":\"Artificial Life and Robotics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Life and Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10015-023-00879-7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ROBOTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Life and Robotics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s10015-023-00879-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

摘要

在这项研究中,我们考虑了位于偏远地区或被灾害隔离地区的多户家庭使用电动汽车时的电力输送问题。提出并比较了两个优化问题;它们分别产生最小化电动汽车的总行驶距离和它们的总电力消耗的最优路线。我们假设该地区需要电力输送的家庭数量和用于电力输送的电动汽车数量为常数。随后,我们将家庭分组,并将每组中的家庭分配给一辆电动汽车。每辆电动汽车在向分配的组中的所有家庭输送电力后,都需要返回到其初始位置。在第一种方法,即基准方法中,使用动态规划方法来确定使所有电动汽车的总行驶距离最小化的最佳路线。然而,由于道路上的交通拥堵,使所有电动汽车的总行驶距离最小化的最佳路径不一定产生其最小的总电力消耗。在本研究中,为了直接最小化所有考虑的电动汽车的总体电力消耗,我们提出了一种考虑交通拥堵的优化方法。因此,提出了第二种方法,该方法在考虑交通拥堵的情况下使总电力消耗最小化。每个电动汽车行驶过程中消耗的电力是根据每个路段的长度和该路段上车辆的标称平均速度计算的。进行了一个案例研究,其中四辆电动汽车被分配为八户家庭提供电力,以验证所提出的方法。为了验证该方法的有效性,将考虑交通拥堵的计算结果与基准方法的结果进行了比较,使行驶距离最小化。两种不同方法的结果比较表明,与基准方法相比,所提出方法的最优解将所有电动汽车的总功耗降低了236.5(kWh)(9.4%)。因此,所提出的方法对于降低电动汽车的总电力消耗是优选的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Route planning algorithm based on dynamic programming for electric vehicles delivering electric power to a region isolated from power grid

Route planning algorithm based on dynamic programming for electric vehicles delivering electric power to a region isolated from power grid

In this study, we considered the electric power delivery problem when using electric vehicles (EVs) for multiple households located in a remote region or a region isolated by disasters. Two optimization problems are formulated and compared; they yield the optimal routes that minimize the overall traveling distance of the EVs and their overall electric power consumption, respectively. We assume that the number of households requiring power delivery and the number of EVs used for power delivery in the region are given constants. Subsequently, we divide the households into groups and assign the households in each group to one EV. Each EV is required to return to its initial position after delivering electric power to all the households in the assigned group. In the first method, the benchmark method, the optimal route that minimizes the overall traveling distance of all the EVs is determined using the dynamic programming method. However, owing to traffic congestion on the roads, the optimal path that minimizes the overall traveling distance of all the EVs does not necessarily yield their minimum overall electric power consumption. In this study, to directly minimize the overall electric power consumption of all the considered EVs, we propose an optimization method that considers traffic congestion. Therefore, a second method is proposed, which minimizes the overall electric power consumption considering traffic congestion. The electric power consumed during the travel of each EV is calculated as a function of the length of each road section and the nominal average speed of vehicles on the road section. A case study in which four EVs are assigned to deliver electric power to serve eight households is conducted to validate the proposed method. To verify the effectiveness of the proposed method, the calculation results considering traffic congestion are compared with the benchmark method results, which minimizes the traveling distance. The comparison of the results from the two different methods shows that the optimal solution for the proposed method reduces the overall electric power consumption of all the EVs by 236.5(kWh) (9.4%) compared with the benchmark method. Therefore, the proposed method is preferable for the reduction of the overall electric power consumption of EVs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
22.20%
发文量
101
期刊介绍: Artificial Life and Robotics is an international journal publishing original technical papers and authoritative state-of-the-art reviews on the development of new technologies concerning artificial life and robotics, especially computer-based simulation and hardware for the twenty-first century. This journal covers a broad multidisciplinary field, including areas such as artificial brain research, artificial intelligence, artificial life, artificial living, artificial mind research, brain science, chaos, cognitive science, complexity, computer graphics, evolutionary computations, fuzzy control, genetic algorithms, innovative computations, intelligent control and modelling, micromachines, micro-robot world cup soccer tournament, mobile vehicles, neural networks, neurocomputers, neurocomputing technologies and applications, robotics, robus virtual engineering, and virtual reality. Hardware-oriented submissions are particularly welcome. Publishing body: International Symposium on Artificial Life and RoboticsEditor-in-Chiei: Hiroshi Tanaka Hatanaka R Apartment 101, Hatanaka 8-7A, Ooaza-Hatanaka, Oita city, Oita, Japan 870-0856 ©International Symposium on Artificial Life and Robotics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信