Genetic algorithm with an event-based simulator for solving the fleet allocation problem in an electric vehicle sharing system

Hui-Chieh Li , Chung-Cheng Lu , Timo Eccarius , Min-Yi Hsieh
{"title":"Genetic algorithm with an event-based simulator for solving the fleet allocation problem in an electric vehicle sharing system","authors":"Hui-Chieh Li ,&nbsp;Chung-Cheng Lu ,&nbsp;Timo Eccarius ,&nbsp;Min-Yi Hsieh","doi":"10.1016/j.eastsj.2022.100060","DOIUrl":null,"url":null,"abstract":"<div><p>The study deals with the fleet allocation problem in public electric vehicle (EV) systems with consideration of demand uncertainty. The problem aims to determine the optimal number of EVs deployed at each station and the objective is to minimize the total system cost. We propose a genetic algorithm (GA) with an event-based simulator to solve this problem. To consider demand uncertainty, an event-based simulator is developed and embedded in the GA. This study generates and solves a number of instances based on the historical data obtained from an EV-Sharing system operator in Sun Moon Lake national park in Taiwan. We compare the solutions of the GA with those of an enumeration method. The results show that the GA is able to obtain the optimal solution for more than 70% of the instances. Even when the GA fails to find the optimum, the gaps between optimal solutions and heuristic solutions are less than 0.1%. Moreover, all solutions are found within a reasonable amount of time. The proposed solution approach provides decision support for the fleet allocation in EV-sharing systems.</p></div>","PeriodicalId":100131,"journal":{"name":"Asian Transport Studies","volume":"8 ","pages":"Article 100060"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2185556022000062/pdfft?md5=88140593fbeef3f1b23754834dc9a318&pid=1-s2.0-S2185556022000062-main.pdf","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Transport Studies","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2185556022000062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The study deals with the fleet allocation problem in public electric vehicle (EV) systems with consideration of demand uncertainty. The problem aims to determine the optimal number of EVs deployed at each station and the objective is to minimize the total system cost. We propose a genetic algorithm (GA) with an event-based simulator to solve this problem. To consider demand uncertainty, an event-based simulator is developed and embedded in the GA. This study generates and solves a number of instances based on the historical data obtained from an EV-Sharing system operator in Sun Moon Lake national park in Taiwan. We compare the solutions of the GA with those of an enumeration method. The results show that the GA is able to obtain the optimal solution for more than 70% of the instances. Even when the GA fails to find the optimum, the gaps between optimal solutions and heuristic solutions are less than 0.1%. Moreover, all solutions are found within a reasonable amount of time. The proposed solution approach provides decision support for the fleet allocation in EV-sharing systems.

基于事件模拟器的遗传算法求解电动汽车共享系统中的车队分配问题
研究了考虑需求不确定性的公共电动汽车系统的车队分配问题。该问题的目的是确定在每个站点部署的电动汽车的最佳数量,目标是使系统总成本最小化。我们提出了一种基于事件模拟器的遗传算法来解决这个问题。为了考虑需求的不确定性,开发了一个基于事件的仿真器并将其嵌入到遗传算法中。本研究以台湾日月潭国家公园电动汽车共享系统营运商的历史资料为基础,生成并解决若干实例。我们比较了遗传算法的解与枚举法的解。结果表明,遗传算法能够在70%以上的实例中获得最优解。即使遗传算法没有找到最优解,最优解和启发式解之间的差距也小于0.1%。此外,所有的解决方案都是在合理的时间内找到的。该解决方案为电动汽车共享系统中的车队分配提供决策支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.10
自引率
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学术官方微信