Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities

IF 0.7 4区 数学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Sara Hatami, M. Eskandarpour, M. Serrano, Ángel Alejandro Juan Pérez, D. Ouelhadj
{"title":"Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities","authors":"Sara Hatami, M. Eskandarpour, M. Serrano, Ángel Alejandro Juan Pérez, D. Ouelhadj","doi":"10.2436/20.8080.02.98","DOIUrl":null,"url":null,"abstract":"The introduction of Electric Vehicles (EVs) in modern fleets facilitates green road transportation. However, the driving ranges of EVs are limited by the duration of their batteries, which arise new operational challenges. Hybrid fleets of gas and EVs might be heterogeneous both in loading capacities as well as in driving-range capabilities,whichmakes the design of efficient routing plans a difficult task. In this paper, we propose a newMulti-Round IteratedGreedy (MRIG) metaheuristic to solve the Heterogeneous Vehicle Routing Problem with Multiple Driving ranges and loading capacities (HeVRPMD). MRIG uses a successive approximations method to offer the decision maker a set of alternative fleet configurations,with different distance-based costs and green levels. The numerical experiments show that MRIG is able to outperform previous works dealing with the homogeneous version of the problem, which assumes the same loading capacity for all vehicles in the fleet. The numerical experiments also confirm that the proposed MRIG approach extends previous works by solving a more realistic HeVRPMD and provides the decision-maker with fleets with higher green levels.","PeriodicalId":49497,"journal":{"name":"Sort-Statistics and Operations Research Transactions","volume":"32 1","pages":"141-170"},"PeriodicalIF":0.7000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sort-Statistics and Operations Research Transactions","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2436/20.8080.02.98","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 9

Abstract

The introduction of Electric Vehicles (EVs) in modern fleets facilitates green road transportation. However, the driving ranges of EVs are limited by the duration of their batteries, which arise new operational challenges. Hybrid fleets of gas and EVs might be heterogeneous both in loading capacities as well as in driving-range capabilities,whichmakes the design of efficient routing plans a difficult task. In this paper, we propose a newMulti-Round IteratedGreedy (MRIG) metaheuristic to solve the Heterogeneous Vehicle Routing Problem with Multiple Driving ranges and loading capacities (HeVRPMD). MRIG uses a successive approximations method to offer the decision maker a set of alternative fleet configurations,with different distance-based costs and green levels. The numerical experiments show that MRIG is able to outperform previous works dealing with the homogeneous version of the problem, which assumes the same loading capacity for all vehicles in the fleet. The numerical experiments also confirm that the proposed MRIG approach extends previous works by solving a more realistic HeVRPMD and provides the decision-maker with fleets with higher green levels.
使用电动汽车的绿色混合动力车队:解决多行驶里程和多载重能力的异构车辆路径问题
电动汽车(ev)在现代车队中的引入促进了绿色道路交通。然而,电动汽车的行驶里程受到电池续航时间的限制,这带来了新的运营挑战。汽油和电动汽车的混合动力车队在装载能力和行驶里程方面可能存在差异,这使得设计有效的路线规划成为一项艰巨的任务。本文提出了一种新的多轮迭代贪心(MRIG)元启发式算法来解决具有多行驶里程和负载能力的异构车辆路由问题(HeVRPMD)。MRIG使用连续逼近方法为决策者提供一组可选的车队配置,这些配置具有不同的基于距离的成本和绿色水平。数值实验表明,MRIG算法能够优于以往的同质版本算法,即假设车队中所有车辆的装载能力相同。数值实验也证实了所提出的MRIG方法通过解决更现实的HeVRPMD而扩展了先前的工作,并为决策者提供了更高绿色水平的车队。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Sort-Statistics and Operations Research Transactions
Sort-Statistics and Operations Research Transactions 管理科学-统计学与概率论
CiteScore
3.10
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: SORT (Statistics and Operations Research Transactions) —formerly Qüestiió— is an international journal launched in 2003. It is published twice-yearly, in English, by the Statistical Institute of Catalonia (Idescat). The journal is co-edited by the Universitat Politècnica de Catalunya, Universitat de Barcelona, Universitat Autonòma de Barcelona, Universitat de Girona, Universitat Pompeu Fabra i Universitat de Lleida, with the co-operation of the Spanish Section of the International Biometric Society and the Catalan Statistical Society. SORT promotes the publication of original articles of a methodological or applied nature or motivated by an applied problem in statistics, operations research, official statistics or biometrics as well as book reviews. We encourage authors to include an example of a real data set in their manuscripts.
×
引用
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学术官方微信