电动汽车充电管理的指数锥规划方法

IF 0.7 4区 管理学 Q3 Engineering
Li Chen, Long He, Y. Zhou
{"title":"电动汽车充电管理的指数锥规划方法","authors":"Li Chen, Long He, Y. Zhou","doi":"10.1287/opre.2023.2460","DOIUrl":null,"url":null,"abstract":"In “An Exponential Cone programming Approach for Managing Electric Vehicle Charging,” Chen, He, and Zhou propose a novel ECP approach to solving large-scale optimization of electric vehicle charging in public stations such as EVgo. Other than the stochastic arrivals of customers with different arrival/departure times and charging requirements, charging stations routinely incur high demand charges, costs related to the highest per-period total electricity used in a billing cycle, which can be as high as 70% of the total electricity bill. For the case with unlimited chargers, the authors characterize the theoretical performances of the ECP approach. For the case with limited chargers, the authors construct an ECP leveraging the idea from distributionally robust optimization and show in a data-calibrated numerical study that it performs better than common approaches, considering many practical implementation issues. The authors’ method of constructing ECPs can be potentially applicable to approximate more general two-stage stochastic programs.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"18 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Exponential Cone Programming Approach for Managing Electric Vehicle Charging\",\"authors\":\"Li Chen, Long He, Y. Zhou\",\"doi\":\"10.1287/opre.2023.2460\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In “An Exponential Cone programming Approach for Managing Electric Vehicle Charging,” Chen, He, and Zhou propose a novel ECP approach to solving large-scale optimization of electric vehicle charging in public stations such as EVgo. Other than the stochastic arrivals of customers with different arrival/departure times and charging requirements, charging stations routinely incur high demand charges, costs related to the highest per-period total electricity used in a billing cycle, which can be as high as 70% of the total electricity bill. For the case with unlimited chargers, the authors characterize the theoretical performances of the ECP approach. For the case with limited chargers, the authors construct an ECP leveraging the idea from distributionally robust optimization and show in a data-calibrated numerical study that it performs better than common approaches, considering many practical implementation issues. The authors’ method of constructing ECPs can be potentially applicable to approximate more general two-stage stochastic programs.\",\"PeriodicalId\":49809,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":\"18 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2023.2460\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2023.2460","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 5

摘要

在“管理电动汽车充电的指数锥规划方法”中,Chen、He和Zhou提出了一种新的ECP方法来解决EVgo等公共充电站电动汽车充电的大规模优化问题。除了随机到达的客户有不同的到达/离开时间和充电要求外,充电站通常会产生较高的需求费用,与结算周期内每段总用电量最高相关的成本,可高达总电费的70%。对于无限充电器的情况,作者描述了ECP方法的理论性能。对于充电器有限的情况,作者利用分布式鲁棒优化的思想构建了一个ECP,并在数据校准的数值研究中表明,考虑到许多实际实施问题,它比普通方法性能更好。作者的构造ecp的方法可以潜在地适用于近似更一般的两阶段随机规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Exponential Cone Programming Approach for Managing Electric Vehicle Charging
In “An Exponential Cone programming Approach for Managing Electric Vehicle Charging,” Chen, He, and Zhou propose a novel ECP approach to solving large-scale optimization of electric vehicle charging in public stations such as EVgo. Other than the stochastic arrivals of customers with different arrival/departure times and charging requirements, charging stations routinely incur high demand charges, costs related to the highest per-period total electricity used in a billing cycle, which can be as high as 70% of the total electricity bill. For the case with unlimited chargers, the authors characterize the theoretical performances of the ECP approach. For the case with limited chargers, the authors construct an ECP leveraging the idea from distributionally robust optimization and show in a data-calibrated numerical study that it performs better than common approaches, considering many practical implementation issues. The authors’ method of constructing ECPs can be potentially applicable to approximate more general two-stage stochastic programs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
×
引用
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学术官方微信