Energy-efficient routing for electric vehicles using metaheuristic optimization frameworks

R. Abousleiman, O. Rawashdeh
{"title":"Energy-efficient routing for electric vehicles using metaheuristic optimization frameworks","authors":"R. Abousleiman, O. Rawashdeh","doi":"10.1109/MELCON.2014.6820550","DOIUrl":null,"url":null,"abstract":"Electric vehicles are gaining an increased market share. People are becoming more acceptable of this new technology as it continues to gain momentum especially in the North American and European markets. The main reasons behind this trend are the growing concerns about the environment, energy dependency, and the unstable fuel prices. Traditional source-to-destination routing problems are designed for conventional fossil-fuel vehicles. These routing methods are based on Dijkstra or Dijkstra-like algorithms and they either optimize the traveled time or the traveled distance. These optimizers will most likely not yield an energy efficient route selection for an electric vehicle. Electric vehicles might regenerate energy causing negative edge costs that deem Dijkstra or Dijkstra-like algorithms not useful for this application (at least without some modifications). In this paper, we present examples of why traditional routing algorithms would not work for electric vehicles. A metaheuristic study of the energy-efficient routing problem is presented. Ant Colony Optimization and Particle Swarm Optimization are then used to solve the energy efficient routing problem for electric vehicles. The 2 metaheuristic methods are analyzed and studied; the results and performance of each are then compared and contrasted.","PeriodicalId":103316,"journal":{"name":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MELECON 2014 - 2014 17th IEEE Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.2014.6820550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Electric vehicles are gaining an increased market share. People are becoming more acceptable of this new technology as it continues to gain momentum especially in the North American and European markets. The main reasons behind this trend are the growing concerns about the environment, energy dependency, and the unstable fuel prices. Traditional source-to-destination routing problems are designed for conventional fossil-fuel vehicles. These routing methods are based on Dijkstra or Dijkstra-like algorithms and they either optimize the traveled time or the traveled distance. These optimizers will most likely not yield an energy efficient route selection for an electric vehicle. Electric vehicles might regenerate energy causing negative edge costs that deem Dijkstra or Dijkstra-like algorithms not useful for this application (at least without some modifications). In this paper, we present examples of why traditional routing algorithms would not work for electric vehicles. A metaheuristic study of the energy-efficient routing problem is presented. Ant Colony Optimization and Particle Swarm Optimization are then used to solve the energy efficient routing problem for electric vehicles. The 2 metaheuristic methods are analyzed and studied; the results and performance of each are then compared and contrasted.
基于元启发式优化框架的电动汽车节能路径
电动汽车的市场份额正在增加。人们越来越接受这项新技术,因为它继续获得动力,特别是在北美和欧洲市场。这一趋势背后的主要原因是对环境、能源依赖和不稳定的燃料价格的日益关注。传统的从源头到目的地的路线问题是为传统的化石燃料汽车设计的。这些路由方法基于Dijkstra或类Dijkstra算法,它们要么优化行进时间,要么优化行进距离。这些优化器很可能无法为电动汽车提供节能路线选择。电动汽车可能会再生能源,导致负边缘成本,这使得Dijkstra或类似Dijkstra的算法对这种应用没有用处(至少在没有进行一些修改的情况下)。在本文中,我们给出了为什么传统的路由算法不适用于电动汽车的例子。提出了一种节能路由问题的元启发式研究方法。然后利用蚁群算法和粒子群算法求解电动汽车的节能路径问题。对两种元启发式方法进行了分析和研究;然后对每一个的结果和性能进行比较和对比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信