多目标电动汽车充电网络规划,考虑充电行程的偶然性约束

IF 1.9 4区 工程技术 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Yunxiang Guo, Xinsong Zhang, Daxiang Li, Chenghong Gu, Cheng Lu, Ting Ji, Yue Wang
{"title":"多目标电动汽车充电网络规划,考虑充电行程的偶然性约束","authors":"Yunxiang Guo, Xinsong Zhang, Daxiang Li, Chenghong Gu, Cheng Lu, Ting Ji, Yue Wang","doi":"10.1049/2023/6690544","DOIUrl":null,"url":null,"abstract":"Electric vehicle charging stations (EVCSs) are important infrastructures to support sustainable development of electric vehicles (EVs), by providing convenient, rapid charging services. Therefore, the planning of electric vehicle charging network (EVCN) has attracted wide interest from both industry and academia. In this paper, a multiobjective planning model for EVCN is developed, where a fixed number of EVCSs are planned in the traffic network (TN) to achieve two objectives, i.e., minimizing both average travel distance for charging (TDfC) of EVs and investment costs of EVCN. According to the random characteristics of EVs’ TDfC, its constraint is presented as a chance constraint in the developed EVCN planning model. The nondominated sorting genetic Algorithm II with the constraint domination principle (NSGA-II-CDP) is customized to solve the developed multiobjective EVCN planning model, by designing a special coding scheme, a crossover operator, and a mutation operator. Then, a maximum gradient principle of investment revenue is designed to select the optimal planning strategy from the Pareto-optimal solution set, when taking the investment return ratio as primary consideration. A 25-node TN is used to justify the effectiveness of the developed methodology.","PeriodicalId":48518,"journal":{"name":"IET Electrical Systems in Transportation","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiobjective Electric Vehicle Charging Network Planning Considering Chance-Constraint on the Travel Distance for Charging\",\"authors\":\"Yunxiang Guo, Xinsong Zhang, Daxiang Li, Chenghong Gu, Cheng Lu, Ting Ji, Yue Wang\",\"doi\":\"10.1049/2023/6690544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Electric vehicle charging stations (EVCSs) are important infrastructures to support sustainable development of electric vehicles (EVs), by providing convenient, rapid charging services. Therefore, the planning of electric vehicle charging network (EVCN) has attracted wide interest from both industry and academia. In this paper, a multiobjective planning model for EVCN is developed, where a fixed number of EVCSs are planned in the traffic network (TN) to achieve two objectives, i.e., minimizing both average travel distance for charging (TDfC) of EVs and investment costs of EVCN. According to the random characteristics of EVs’ TDfC, its constraint is presented as a chance constraint in the developed EVCN planning model. The nondominated sorting genetic Algorithm II with the constraint domination principle (NSGA-II-CDP) is customized to solve the developed multiobjective EVCN planning model, by designing a special coding scheme, a crossover operator, and a mutation operator. Then, a maximum gradient principle of investment revenue is designed to select the optimal planning strategy from the Pareto-optimal solution set, when taking the investment return ratio as primary consideration. A 25-node TN is used to justify the effectiveness of the developed methodology.\",\"PeriodicalId\":48518,\"journal\":{\"name\":\"IET Electrical Systems in Transportation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2023-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Electrical Systems in Transportation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1049/2023/6690544\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Electrical Systems in Transportation","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1049/2023/6690544","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

电动汽车充电站(EVCS)是支持电动汽车(EV)可持续发展的重要基础设施,可提供方便、快捷的充电服务。因此,电动汽车充电网络(EVCN)的规划引起了业界和学术界的广泛关注。本文建立了一个电动汽车充电网络的多目标规划模型,在交通网络(TN)中规划固定数量的电动汽车充电站,以实现两个目标,即电动汽车平均充电距离(TDfC)最小化和电动汽车充电网络投资成本最小化。根据电动汽车 TDfC 的随机特性,其约束条件在所开发的 EVCN 规划模型中以偶然约束的形式出现。通过设计特殊的编码方案、交叉算子和变异算子,定制了具有约束支配原则的非支配排序遗传算法 II(NSGA-II-CDP)来求解所开发的多目标 EVCN 规划模型。然后,设计了投资收益最大梯度原则,以投资回报率为主要考虑因素,从帕累托最优解集中选择最优规划策略。通过一个 25 节点的 TN 验证了所开发方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiobjective Electric Vehicle Charging Network Planning Considering Chance-Constraint on the Travel Distance for Charging
Electric vehicle charging stations (EVCSs) are important infrastructures to support sustainable development of electric vehicles (EVs), by providing convenient, rapid charging services. Therefore, the planning of electric vehicle charging network (EVCN) has attracted wide interest from both industry and academia. In this paper, a multiobjective planning model for EVCN is developed, where a fixed number of EVCSs are planned in the traffic network (TN) to achieve two objectives, i.e., minimizing both average travel distance for charging (TDfC) of EVs and investment costs of EVCN. According to the random characteristics of EVs’ TDfC, its constraint is presented as a chance constraint in the developed EVCN planning model. The nondominated sorting genetic Algorithm II with the constraint domination principle (NSGA-II-CDP) is customized to solve the developed multiobjective EVCN planning model, by designing a special coding scheme, a crossover operator, and a mutation operator. Then, a maximum gradient principle of investment revenue is designed to select the optimal planning strategy from the Pareto-optimal solution set, when taking the investment return ratio as primary consideration. A 25-node TN is used to justify the effectiveness of the developed methodology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.80
自引率
4.30%
发文量
18
审稿时长
29 weeks
×
引用
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学术官方微信