考虑交通条件和实时负荷的电动汽车路径问题

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY
Jingyi Zhao , Zirong Zeng , Yang Liu
{"title":"考虑交通条件和实时负荷的电动汽车路径问题","authors":"Jingyi Zhao ,&nbsp;Zirong Zeng ,&nbsp;Yang Liu","doi":"10.1016/j.trc.2025.105150","DOIUrl":null,"url":null,"abstract":"<div><div>Eco-driving strategies aim to reduce energy consumption (EC), greenhouse gas (GHG) emissions, and accident rates, and to promote environmental benefits. One of the efficient ways to reduce GHG emissions is using electric vehicles (EV) to replace fuel ones. Inspired by these, in this paper, we study an electric vehicle routing problem (EVRP) with the objective of minimizing the total EC of the vehicles during transportation. Specifically, we consider segmented linear speed functions that simulate traffic conditions and take into account the impact of real-time load and acceleration of EVs on energy consumption. The speed model accurately captures gradual changes in vehicle speed, reflecting real-world road conditions more realistically. We define this problem as a time and load-dependent EVRP (TLD-EVRP). This problem is difficult to solve not only because it considers both real-time vehicle speed and load conditions but also because the problem is modeled as nonlinear (with quadratic and cubic terms of vehicle speed). The goal is to minimize the EC of the electric vehicle, and this integration will improve energy efficiency and environmental benefits. To tackle this TLD-EVRP, a meta-heuristic algorithm is developed, combining a Large Neighborhood Search (LNS) with a Local Search (LS) procedure and a split algorithm for efficient route segmentation for individual EVs. The set partitioning problem (SPP) is used to recombine the routes. The goal of the algorithm is to develop a robust tool to address the complexity of TLD-EVRPs with different sizes and distributions. The proposed approach is evaluated using a small-scale real-world test case and extensive experiments are then conducted on randomly generated large-scale data. The evaluation results show that our algorithm can handle large-scale instances of up to 1000 customers and exhibits robustness on large data. By promoting energy-efficient practices in the transportation sector, the proposed methodology contributes to the achievement of green and low-carbon goals.</div></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":"176 ","pages":"Article 105150"},"PeriodicalIF":7.6000,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Electric vehicle routing problem considering traffic conditions and real-time loads\",\"authors\":\"Jingyi Zhao ,&nbsp;Zirong Zeng ,&nbsp;Yang Liu\",\"doi\":\"10.1016/j.trc.2025.105150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Eco-driving strategies aim to reduce energy consumption (EC), greenhouse gas (GHG) emissions, and accident rates, and to promote environmental benefits. One of the efficient ways to reduce GHG emissions is using electric vehicles (EV) to replace fuel ones. Inspired by these, in this paper, we study an electric vehicle routing problem (EVRP) with the objective of minimizing the total EC of the vehicles during transportation. Specifically, we consider segmented linear speed functions that simulate traffic conditions and take into account the impact of real-time load and acceleration of EVs on energy consumption. The speed model accurately captures gradual changes in vehicle speed, reflecting real-world road conditions more realistically. We define this problem as a time and load-dependent EVRP (TLD-EVRP). This problem is difficult to solve not only because it considers both real-time vehicle speed and load conditions but also because the problem is modeled as nonlinear (with quadratic and cubic terms of vehicle speed). The goal is to minimize the EC of the electric vehicle, and this integration will improve energy efficiency and environmental benefits. To tackle this TLD-EVRP, a meta-heuristic algorithm is developed, combining a Large Neighborhood Search (LNS) with a Local Search (LS) procedure and a split algorithm for efficient route segmentation for individual EVs. The set partitioning problem (SPP) is used to recombine the routes. The goal of the algorithm is to develop a robust tool to address the complexity of TLD-EVRPs with different sizes and distributions. The proposed approach is evaluated using a small-scale real-world test case and extensive experiments are then conducted on randomly generated large-scale data. The evaluation results show that our algorithm can handle large-scale instances of up to 1000 customers and exhibits robustness on large data. By promoting energy-efficient practices in the transportation sector, the proposed methodology contributes to the achievement of green and low-carbon goals.</div></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":\"176 \",\"pages\":\"Article 105150\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X25001548\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X25001548","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

生态驾驶策略旨在减少能源消耗(EC)、温室气体(GHG)排放和事故率,促进环境效益。减少温室气体排放的有效方法之一是使用电动汽车(EV)取代燃油汽车。受此启发,本文研究了以车辆总EC最小为目标的电动汽车路径问题。具体来说,我们考虑了模拟交通状况的分段线性速度函数,并考虑了电动汽车的实时负载和加速对能耗的影响。速度模型准确地捕捉了车辆速度的逐渐变化,更真实地反映了现实世界的道路状况。我们将此问题定义为与时间和负载相关的EVRP (TLD-EVRP)。该问题求解困难,不仅因为它同时考虑了实时车速和载荷条件,而且由于该问题是非线性建模的(包含车速的二次项和三次项)。目标是尽量减少电动汽车的EC,这种整合将提高能源效率和环境效益。为了解决这一问题,提出了一种元启发式算法,该算法结合了大邻居搜索(LNS)和本地搜索(LS)过程,以及一种针对单个电动汽车的有效路由分割算法。采用集划分问题(SPP)对路由进行重组。该算法的目标是开发一个强大的工具来解决不同大小和分布的tld - evrp的复杂性。提出的方法是用一个小规模的真实世界的测试用例进行评估,然后在随机生成的大规模数据上进行广泛的实验。评估结果表明,该算法可以处理多达1000个客户的大规模实例,并且在大数据上具有鲁棒性。通过在运输部门推广节能措施,建议的方法有助于实现绿色和低碳目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Electric vehicle routing problem considering traffic conditions and real-time loads
Eco-driving strategies aim to reduce energy consumption (EC), greenhouse gas (GHG) emissions, and accident rates, and to promote environmental benefits. One of the efficient ways to reduce GHG emissions is using electric vehicles (EV) to replace fuel ones. Inspired by these, in this paper, we study an electric vehicle routing problem (EVRP) with the objective of minimizing the total EC of the vehicles during transportation. Specifically, we consider segmented linear speed functions that simulate traffic conditions and take into account the impact of real-time load and acceleration of EVs on energy consumption. The speed model accurately captures gradual changes in vehicle speed, reflecting real-world road conditions more realistically. We define this problem as a time and load-dependent EVRP (TLD-EVRP). This problem is difficult to solve not only because it considers both real-time vehicle speed and load conditions but also because the problem is modeled as nonlinear (with quadratic and cubic terms of vehicle speed). The goal is to minimize the EC of the electric vehicle, and this integration will improve energy efficiency and environmental benefits. To tackle this TLD-EVRP, a meta-heuristic algorithm is developed, combining a Large Neighborhood Search (LNS) with a Local Search (LS) procedure and a split algorithm for efficient route segmentation for individual EVs. The set partitioning problem (SPP) is used to recombine the routes. The goal of the algorithm is to develop a robust tool to address the complexity of TLD-EVRPs with different sizes and distributions. The proposed approach is evaluated using a small-scale real-world test case and extensive experiments are then conducted on randomly generated large-scale data. The evaluation results show that our algorithm can handle large-scale instances of up to 1000 customers and exhibits robustness on large data. By promoting energy-efficient practices in the transportation sector, the proposed methodology contributes to the achievement of green and low-carbon goals.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
×
引用
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学术官方微信