Maximum flow‐based formulation for the optimal location of electric vehicle charging stations

IF 1.6 4区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Networks Pub Date : 2024-04-11 DOI:10.1002/net.22219
Pierre‐Luc Parent, Margarida Carvalho, Miguel F. Anjos, Ribal Atallah
{"title":"Maximum flow‐based formulation for the optimal location of electric vehicle charging stations","authors":"Pierre‐Luc Parent, Margarida Carvalho, Miguel F. Anjos, Ribal Atallah","doi":"10.1002/net.22219","DOIUrl":null,"url":null,"abstract":"With the increasing effects of climate change, the urgency to step away from fossil fuels is greater than ever before. Electric vehicles (EVs) are one way to diminish these effects, but their widespread adoption is often limited by the insufficient availability of charging stations. In this work, our goal is to expand the infrastructure of EV charging stations, in order to provide a better quality of service in terms of user satisfaction (and availability of charging stations). Specifically, our focus is directed towards urban areas. We first propose a model for the assignment of EV charging demand to stations, framing it as a maximum flow problem. This model is the basis for the evaluation of user satisfaction with a given charging infrastructure. Secondly, we incorporate the maximum flow model into a mixed‐integer linear program, where decisions on the opening of new stations and on the expansion of their capacity through additional outlets is accounted for. We showcase our methodology for the city of Montreal, demonstrating the scalability of our approach to handle real‐world scenarios. We conclude that considering both spacial and temporal variations in charging demand is meaningful when solving realistic instances.","PeriodicalId":54734,"journal":{"name":"Networks","volume":"440 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1002/net.22219","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

With the increasing effects of climate change, the urgency to step away from fossil fuels is greater than ever before. Electric vehicles (EVs) are one way to diminish these effects, but their widespread adoption is often limited by the insufficient availability of charging stations. In this work, our goal is to expand the infrastructure of EV charging stations, in order to provide a better quality of service in terms of user satisfaction (and availability of charging stations). Specifically, our focus is directed towards urban areas. We first propose a model for the assignment of EV charging demand to stations, framing it as a maximum flow problem. This model is the basis for the evaluation of user satisfaction with a given charging infrastructure. Secondly, we incorporate the maximum flow model into a mixed‐integer linear program, where decisions on the opening of new stations and on the expansion of their capacity through additional outlets is accounted for. We showcase our methodology for the city of Montreal, demonstrating the scalability of our approach to handle real‐world scenarios. We conclude that considering both spacial and temporal variations in charging demand is meaningful when solving realistic instances.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最大流量的电动汽车充电站优化选址方案
随着气候变化的影响日益加剧,人们比以往任何时候都更迫切需要摆脱化石燃料。电动汽车(EV)是减少这些影响的一种方式,但其广泛采用往往受到充电站不足的限制。在这项工作中,我们的目标是扩大电动汽车充电站的基础设施,以便在用户满意度(和充电站可用性)方面提供更优质的服务。具体来说,我们的重点是城市地区。我们首先提出了一个将电动汽车充电需求分配到充电站的模型,将其视为一个最大流量问题。该模型是评估用户对给定充电基础设施满意度的基础。其次,我们将最大流量模型纳入一个混合整数线性程序,在该程序中,关于开设新充电站和通过增加网点扩大充电站容量的决策都被考虑在内。我们在蒙特利尔市展示了我们的方法,证明我们的方法具有可扩展性,能够处理现实世界中的各种情况。我们的结论是,在解决实际问题时,考虑充电需求的空间和时间变化是有意义的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Networks
Networks 工程技术-计算机:硬件
CiteScore
4.40
自引率
9.50%
发文量
46
审稿时长
12 months
期刊介绍: Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context. The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics. Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally efficient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without significant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.
期刊最新文献
Finding conserved low‐diameter subgraphs in social and biological networks A survey on optimization studies of group centrality metrics A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques Three network design problems for community energy storage
×
引用
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