The close-open mixed-fleet electric vehicle routing problem

IF 6.8 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Cleaner Logistics and Supply Chain Pub Date : 2023-12-01 Epub Date: 2023-11-22 DOI:10.1016/j.clscn.2023.100125

Themistoklis Stamadianos , Nikolaos A. Kyriakakis , Magdalene Marinaki , Yannis Marinakis

{"title":"The close-open mixed-fleet electric vehicle routing problem","authors":"Themistoklis Stamadianos , Nikolaos A. Kyriakakis , Magdalene Marinaki , Yannis Marinakis","doi":"10.1016/j.clscn.2023.100125","DOIUrl":null,"url":null,"abstract":"<div><p>The market of Electric Vehicles (EVs) has grown significantly in recent times. The transportation sector is expected to shift to EVs as well, but there are several significant challenges that make the shift difficult, mainly their capacity for transporting heavy payloads and their high acquisition costs. This research explores a novel business concept wherein a logistics company owns a small fleet of EVs, and rents additional EVs as needed, while providing the option to charge the owned EVs only after completing the final delivery. This concept is modeled as a Close-Open Mixed-fleet Electric Vehicle Routing Problem (COMF-EVRP), and the mathematical formulation is presented. Instances from the literature are adapted for the COMF-EVRP. To solve large instances, three discrete optimization swarm intelligence algorithms are employed, alongside a Variable Neighborhood Search algorithm. Lastly, a comprehensive evaluation of these algorithms’ performance on the COMF-EVRP is provided.</p></div>","PeriodicalId":100253,"journal":{"name":"Cleaner Logistics and Supply Chain","volume":"9 ","pages":"Article 100125"},"PeriodicalIF":6.8000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772390923000343/pdfft?md5=4badb19dde57ea66456a87c9bf3692b3&pid=1-s2.0-S2772390923000343-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cleaner Logistics and Supply Chain","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772390923000343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/11/22 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

Abstract

The market of Electric Vehicles (EVs) has grown significantly in recent times. The transportation sector is expected to shift to EVs as well, but there are several significant challenges that make the shift difficult, mainly their capacity for transporting heavy payloads and their high acquisition costs. This research explores a novel business concept wherein a logistics company owns a small fleet of EVs, and rents additional EVs as needed, while providing the option to charge the owned EVs only after completing the final delivery. This concept is modeled as a Close-Open Mixed-fleet Electric Vehicle Routing Problem (COMF-EVRP), and the mathematical formulation is presented. Instances from the literature are adapted for the COMF-EVRP. To solve large instances, three discrete optimization swarm intelligence algorithms are employed, alongside a Variable Neighborhood Search algorithm. Lastly, a comprehensive evaluation of these algorithms’ performance on the COMF-EVRP is provided.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

闭-开混合车队电动车路径问题

近年来，电动汽车(ev)市场增长显著。交通运输行业预计也将转向电动汽车，但存在一些重大挑战，使这一转变变得困难，主要是电动汽车运输重型有效载荷的能力和高昂的购置成本。本研究探索了一种新颖的商业概念，即物流公司拥有一个小型电动汽车车队，并根据需要租用额外的电动汽车，同时提供只有在完成最终交付后才对所拥有的电动汽车充电的选项。将这一概念建模为封闭开放混合车队电动车路径问题(COMF-EVRP)，并给出了数学表达式。文献中的实例适用于COMF-EVRP。为了解决大型实例，采用了三种离散优化群体智能算法以及可变邻域搜索算法。最后，对这些算法在COMF-EVRP上的性能进行了综合评价。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Cleaner Logistics and Supply Chain

CiteScore

8.60

自引率

0.00%

发文量