The impact of quick charging stations on the route planning of Electric Vehicles

B. Çatay, M. Keskin
{"title":"The impact of quick charging stations on the route planning of Electric Vehicles","authors":"B. Çatay, M. Keskin","doi":"10.1109/ISCC.2017.8024521","DOIUrl":null,"url":null,"abstract":"Many companies have a growing interest in utilizing alternative fuel vehicles in their logistics operations due to increasing environmental concerns in developed countries. Consequently, green vehicle routing problems have attracted more attention in the literature. The Electric Vehicle Routing Problem (EVRP) is one such problem where the customers are served using an electric vehicle (EV) fleet. In this problem, the energy on the battery of the EV is consumed proportionally with distance traveled and the EV may need recharging en route in order to complete its tour. In this study, we consider a variant of EVRP where the customers are associated with service time windows and the stations may be equipped with normal and quick charging systems. In the quick charge case, the battery is recharged with the same energy in a shorter time but at a higher cost. Our objective is to minimize energy costs while operating minimum number of vehicles. We formulate the mathematical programming models of the single and multiple charger cases and solve them using a commercial solver. Our aim is to investigate the complexity of the problems and analyze the potential benefits associated with the quick charging option.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Symposium on Computers and Communications (ISCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2017.8024521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Many companies have a growing interest in utilizing alternative fuel vehicles in their logistics operations due to increasing environmental concerns in developed countries. Consequently, green vehicle routing problems have attracted more attention in the literature. The Electric Vehicle Routing Problem (EVRP) is one such problem where the customers are served using an electric vehicle (EV) fleet. In this problem, the energy on the battery of the EV is consumed proportionally with distance traveled and the EV may need recharging en route in order to complete its tour. In this study, we consider a variant of EVRP where the customers are associated with service time windows and the stations may be equipped with normal and quick charging systems. In the quick charge case, the battery is recharged with the same energy in a shorter time but at a higher cost. Our objective is to minimize energy costs while operating minimum number of vehicles. We formulate the mathematical programming models of the single and multiple charger cases and solve them using a commercial solver. Our aim is to investigate the complexity of the problems and analyze the potential benefits associated with the quick charging option.
快速充电站对电动汽车路线规划的影响
由于发达国家日益增加的环境问题,许多公司对在其物流业务中使用替代燃料汽车越来越感兴趣。因此,绿色车辆路径问题越来越受到文献的关注。电动汽车路线问题(EVRP)就是这样一个问题,客户使用电动汽车(EV)车队服务。在这个问题中,电动汽车电池上的能量与行驶距离成正比,并且电动汽车可能需要在途中充电以完成其行程。在本研究中,我们考虑了EVRP的一种变体,其中客户与服务时间窗口相关联,并且站点可以配备正常和快速充电系统。在快速充电的情况下,电池在更短的时间内以相同的能量充电,但成本更高。我们的目标是在运行最少数量车辆的同时将能源成本降至最低。建立了单充电器和多充电器的数学规划模型,并利用商业求解器进行求解。我们的目的是调查问题的复杂性,并分析与快速充电选项相关的潜在好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信