Improved Antlion Algorithm for Electric Vehicle Charging Station Placement

Mohamed Wajdi Ouertani, G. Manita, O. Korbaa
{"title":"Improved Antlion Algorithm for Electric Vehicle Charging Station Placement","authors":"Mohamed Wajdi Ouertani, G. Manita, O. Korbaa","doi":"10.1109/SETIT54465.2022.9875614","DOIUrl":null,"url":null,"abstract":"Finding the most suitable sites for charging stations (CSs) presents the main challenge to expand the usage of electric vehicle (EV). For this reason, we propose a new model to solve the problem of CSs placement by taking into consideration several parameters. In this work, the travel cost, maintenance, and installation charges of several types of stations are the main variables for calculating the objective function. In addition, we take into account two important constraints: budget limitation and charging station capacity. This problem is described as an NP-hard problem, hence the need to use an optimization method based on meta-heuristics that have proven their effectiveness before.For this purpose, we propose an Improved Antlion Algorithm (IALO) combined with a search heuristic. To assess this approach, we compare it with the most commonly used and recent optimization algorithms, in particular the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA) and Atom Search Optimization (ASO). Experimental results show that improved antlion algorithm provide better solutions than algorithms mentioned above.","PeriodicalId":126155,"journal":{"name":"2022 IEEE 9th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 9th International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SETIT54465.2022.9875614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Finding the most suitable sites for charging stations (CSs) presents the main challenge to expand the usage of electric vehicle (EV). For this reason, we propose a new model to solve the problem of CSs placement by taking into consideration several parameters. In this work, the travel cost, maintenance, and installation charges of several types of stations are the main variables for calculating the objective function. In addition, we take into account two important constraints: budget limitation and charging station capacity. This problem is described as an NP-hard problem, hence the need to use an optimization method based on meta-heuristics that have proven their effectiveness before.For this purpose, we propose an Improved Antlion Algorithm (IALO) combined with a search heuristic. To assess this approach, we compare it with the most commonly used and recent optimization algorithms, in particular the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA) and Atom Search Optimization (ASO). Experimental results show that improved antlion algorithm provide better solutions than algorithms mentioned above.
电动汽车充电站布局的改进Antlion算法
寻找最合适的充电站(CSs)地点是扩大电动汽车(EV)使用的主要挑战。因此,我们提出了一个新的模型,通过考虑几个参数来解决CSs的放置问题。在本工作中,几种类型站点的交通费、维修费和安装费是计算目标函数的主要变量。此外,我们还考虑了两个重要的约束条件:预算限制和充电站容量。这个问题被描述为np困难问题,因此需要使用基于元启发式的优化方法,这种方法之前已经证明了其有效性。为此,我们提出了一种结合搜索启发式的改进Antlion算法(IALO)。为了评估这种方法,我们将其与最常用和最新的优化算法进行比较,特别是遗传算法(GA),粒子群优化(PSO),灰狼优化器(GWO),鲸鱼优化算法(WOA)和原子搜索优化(ASO)。实验结果表明,改进的antlion算法比上述算法提供了更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信