柔性服务操作下的电动汽车充电调度

IF 4.4 2区 工程技术 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Transportation Science Pub Date : 2023-10-26 DOI:10.1287/trsc.2022.0272
Patrick S. Klein, Maximilian Schiffer
{"title":"柔性服务操作下的电动汽车充电调度","authors":"Patrick S. Klein, Maximilian Schiffer","doi":"10.1287/trsc.2022.0272","DOIUrl":null,"url":null,"abstract":"Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"42 1","pages":"0"},"PeriodicalIF":4.4000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Electric Vehicle Charge Scheduling with Flexible Service Operations\",\"authors\":\"Patrick S. Klein, Maximilian Schiffer\",\"doi\":\"10.1287/trsc.2022.0272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .\",\"PeriodicalId\":51202,\"journal\":{\"name\":\"Transportation Science\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2023-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2022.0272\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2022.0272","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 2

摘要

部署大量电动汽车的运营商经常面临一个具有挑战性的充电计划问题。具体来说,时间无效的充电操作限制了在服务操作期间充电的盈利能力,例如运营商在中央仓库为下班的车辆充电。在这里,高昂的投资成本和电网容量限制了可用的充电基础设施,因此运营商需要安排充电操作以保持车队的运行。在这种情况下,灵活的服务操作,即允许延迟或加速车辆离开,可以潜在地提高充电器的利用率。除此之外,通过更好地利用分时电价和精心设计的充电计划,将电池损耗降至最低,联合安排充电和服务操作有望节省运营成本。在此背景下,我们研究了考虑电池退化、非线性充电和分时电价的联合充电和服务运行调度问题。我们提出了一个精确的分支和价格算法,利用自定义分支规则和原始启发式来保持分支和绑定阶段的效率。此外,我们为我们的定价问题开发了一个精确的标签算法,构成了一个考虑可变能源价格和非线性收费操作的资源约束最短路径问题。我们在一个全面的数值研究中对我们的算法进行了基准测试,并表明它可以在一个小时以下的计算时间内解决实际规模的问题实例,从而使其在实践中得到应用。此外,我们还分析了联合调度充电和服务操作的好处。我们发现,我们的综合方法将所需的充电基础设施数量减少了57%,同时还能节省高达5%的运营成本。本研究由德国联邦经济事务和能源部资助[Grant 01MV21020B]。补充材料:在线附录可在https://doi.org/10.1287/trsc.2022.0272上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Electric Vehicle Charge Scheduling with Flexible Service Operations
Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that operators recharge vehicles off duty at a central depot. Here, high investment cost and grid capacity limit available charging infrastructure such that operators need to schedule charging operations to keep the fleet operational. In this context, flexible service operations, that is, allowing delayed or expedited vehicle departures, can potentially increase charger utilization. Beyond this, jointly scheduling charging and service operations promises operational cost savings through better utilization of time-of-use energy tariffs and carefully crafted charging schedules designed to minimize battery wear. Against this background, we study the resulting joint charging and service operations scheduling problem accounting for battery degradation, nonlinear charging, and time-of-use energy tariffs. We propose an exact branch-and-price algorithm, leveraging a custom branching rule and a primal heuristic to remain efficient during the branch-and-bound phase. Moreover, we develop an exact labeling algorithm for our pricing problem, constituting a resource-constrained shortest path problem that considers variable energy prices and nonlinear charging operations. We benchmark our algorithm in a comprehensive numerical study and show that it can solve problem instances of realistic size with computational times below one hour, thus enabling its application in practice. Additionally, we analyze the benefit of jointly scheduling charging and service operations. We find that our integrated approach lowers the amount of charging infrastructure required by up to 57% besides enabling operational cost savings of up to 5%. Funding: This work was supported by the German Federal Ministry for Economic Affairs and Energy [Grant 01MV21020B]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0272 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Science
Transportation Science 工程技术-运筹学与管理科学
CiteScore
8.30
自引率
10.90%
发文量
111
审稿时长
12 months
期刊介绍: Transportation Science, published quarterly by INFORMS, is the flagship journal of the Transportation Science and Logistics Society of INFORMS. As the foremost scientific journal in the cross-disciplinary operational research field of transportation analysis, Transportation Science publishes high-quality original contributions and surveys on phenomena associated with all modes of transportation, present and prospective, including mainly all levels of planning, design, economic, operational, and social aspects. Transportation Science focuses primarily on fundamental theories, coupled with observational and experimental studies of transportation and logistics phenomena and processes, mathematical models, advanced methodologies and novel applications in transportation and logistics systems analysis, planning and design. The journal covers a broad range of topics that include vehicular and human traffic flow theories, models and their application to traffic operations and management, strategic, tactical, and operational planning of transportation and logistics systems; performance analysis methods and system design and optimization; theories and analysis methods for network and spatial activity interaction, equilibrium and dynamics; economics of transportation system supply and evaluation; methodologies for analysis of transportation user behavior and the demand for transportation and logistics services. Transportation Science is international in scope, with editors from nations around the globe. The editorial board reflects the diverse interdisciplinary interests of the transportation science and logistics community, with members that hold primary affiliations in engineering (civil, industrial, and aeronautical), physics, economics, applied mathematics, and business.
期刊最新文献
CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems On-Demand Meal Delivery: A Markov Model for Circulating Couriers Physics-Informed Machine Learning for Calibrating Macroscopic Traffic Flow Models Heatmap Design for Probabilistic Driver Repositioning in Crowdsourced Delivery
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1