Centrally-chosen versus user-selected swaps: How the selection of swapping stations impacts standby battery inventories

IF 6 2区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE European Journal of Operational Research Pub Date : 2024-07-24 DOI:10.1016/j.ejor.2024.07.022
Arne Schulz , Nils Boysen , Dirk Briskorn
{"title":"Centrally-chosen versus user-selected swaps: How the selection of swapping stations impacts standby battery inventories","authors":"Arne Schulz ,&nbsp;Nils Boysen ,&nbsp;Dirk Briskorn","doi":"10.1016/j.ejor.2024.07.022","DOIUrl":null,"url":null,"abstract":"<div><p>Swapping depleted batteries of electric vehicles promises much better driving-to-total-travel-time ratios than plug-in charging. Nonetheless, large-scale battery swapping systems have not successfully established yet. One obstacle, on top of the high infrastructure cost, is certainly the additional invest into extra standby batteries that await their swaps at stations. Existing research is focused on systems in which users decide individually where they want to swap batteries. This system requires significant standby battery inventories to protect against uncertain swapping demand. This paper evaluates another system where users must register their trips on a central platform, so that battery swaps can be coordinated based on central optimization results. To benchmark central optimization and user choice regarding their impact on standby battery inventories, we formulate the min-battery swapping problem: For a given set of vehicle trips, this optimization problem minimizes the number of standby batteries, distributes them in a given station network, and derives detailed swapping plans to feasibly power all trips. First, we present a thorough analysis of computational complexity. Then, we provide an efficient mixed-integer programming formulation that is adaptable to different swapping policies and (when fed into a default solver) solves instances with up to 200 trips to proven optimality in just a few seconds. Our computational study reveals that central optimization promises a significant reduction of standby battery inventories. This potential is shown to increase if swaps of not yet fully-charged batteries are allowed and swaps are pooled at a reduced number of swapping stations.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0377221724005630/pdfft?md5=e1997316fac5d314beac1d9715a3b51b&pid=1-s2.0-S0377221724005630-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377221724005630","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Swapping depleted batteries of electric vehicles promises much better driving-to-total-travel-time ratios than plug-in charging. Nonetheless, large-scale battery swapping systems have not successfully established yet. One obstacle, on top of the high infrastructure cost, is certainly the additional invest into extra standby batteries that await their swaps at stations. Existing research is focused on systems in which users decide individually where they want to swap batteries. This system requires significant standby battery inventories to protect against uncertain swapping demand. This paper evaluates another system where users must register their trips on a central platform, so that battery swaps can be coordinated based on central optimization results. To benchmark central optimization and user choice regarding their impact on standby battery inventories, we formulate the min-battery swapping problem: For a given set of vehicle trips, this optimization problem minimizes the number of standby batteries, distributes them in a given station network, and derives detailed swapping plans to feasibly power all trips. First, we present a thorough analysis of computational complexity. Then, we provide an efficient mixed-integer programming formulation that is adaptable to different swapping policies and (when fed into a default solver) solves instances with up to 200 trips to proven optimality in just a few seconds. Our computational study reveals that central optimization promises a significant reduction of standby battery inventories. This potential is shown to increase if swaps of not yet fully-charged batteries are allowed and swaps are pooled at a reduced number of swapping stations.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
集中选择与用户选择交换:交换站的选择如何影响备用电池库存
与插电式充电相比,更换电动汽车耗尽的电池有望获得更好的行驶时间与总行驶时间比率。然而,大规模的电池交换系统尚未成功建立。除了高昂的基础设施成本外,还有一个障碍就是需要额外投资额外的备用电池,以等待在站点进行更换。现有的研究主要集中在用户自行决定在哪里交换电池的系统上。这种系统需要大量备用电池库存,以应对不确定的交换需求。本文评估了另一种系统,在这种系统中,用户必须在中央平台上登记他们的行程,以便根据中央优化结果协调电池交换。为了对中央优化和用户选择对备用电池库存的影响进行基准测试,我们提出了最小电池交换问题:对于一组给定的车辆行程,该优化问题可最大限度地减少备用电池的数量,将其分配到给定的站点网络中,并得出详细的交换计划,以便为所有行程提供可行的电力。首先,我们对计算复杂性进行了全面分析。然后,我们提供了一个高效的混合整数编程公式,该公式可适应不同的交换策略,(当输入默认求解器时)只需几秒钟就能求解多达 200 个行程的实例,并证明其最优性。我们的计算研究表明,集中优化有望显著减少备用电池库存。如果允许交换尚未充满电的电池,并将交换集中在数量更少的交换站,则这种潜力会更大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
European Journal of Operational Research
European Journal of Operational Research 管理科学-运筹学与管理科学
CiteScore
11.90
自引率
9.40%
发文量
786
审稿时长
8.2 months
期刊介绍: The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.
期刊最新文献
Prelim p. 2; First issue - Editorial Board Editorial Board An exact method for the two-echelon split-delivery vehicle routing problem for liquefied natural gas delivery with the boil-off phenomenon The demand for hedging of oil producers: A tale of risk and regret Data-driven dynamic police patrolling: An efficient Monte Carlo tree search
×
引用
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