带时间窗和部分充电的电动汽车取货问题的自适应混合邻域搜索算法

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Saiqi Zhou , Dezhi Zhang , Shiyan Fang , Shuangyan Li
{"title":"带时间窗和部分充电的电动汽车取货问题的自适应混合邻域搜索算法","authors":"Saiqi Zhou ,&nbsp;Dezhi Zhang ,&nbsp;Shiyan Fang ,&nbsp;Shuangyan Li","doi":"10.1016/j.swevo.2025.102042","DOIUrl":null,"url":null,"abstract":"<div><div>Environmental pressures and measures are compelling the extensive integration of electric vehicles into transportation and logistics systems. This paper focuses on addressing the electric vehicle pickup and delivery problem with time windows and partial charging, in which the amount of charging electricity at charging stations is flexible and determined based on the route schedules. A new effective mixed-integer linear programming model has been developed for the problem. To effectively tackle large-scale instances, we propose an adaptive hybrid neighborhood search algorithm, which is based on the framework of the adaptive large neighborhood search algorithm. The proposed algorithm incorporates various problem-oriented search operators being adaptively chosen for evolution. Meanwhile, dynamic programming-based charging approaches for both full and partial charging policies are presented. Numerical experiments are conducted using benchmark instances of the electric vehicle pickup and delivery problem to verify the effectiveness of our algorithm configurations and its overall performance. The solution results are compared against those obtained using the state-of-the-art algorithm, and the proposed algorithm identifies 21 new best solutions and exhibits greater stability, which demonstrates the competitiveness of the proposed algorithm. Furthermore, the analysis of charging policies provides interesting insights, highlighting the significant advantage of the partial charging policy in scenarios characterized by clustered customer distributions or short scheduling horizons.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102042"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An adaptive hybrid neighborhood search algorithm for the electric vehicle pickup and delivery problem with time windows and partial charging\",\"authors\":\"Saiqi Zhou ,&nbsp;Dezhi Zhang ,&nbsp;Shiyan Fang ,&nbsp;Shuangyan Li\",\"doi\":\"10.1016/j.swevo.2025.102042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Environmental pressures and measures are compelling the extensive integration of electric vehicles into transportation and logistics systems. This paper focuses on addressing the electric vehicle pickup and delivery problem with time windows and partial charging, in which the amount of charging electricity at charging stations is flexible and determined based on the route schedules. A new effective mixed-integer linear programming model has been developed for the problem. To effectively tackle large-scale instances, we propose an adaptive hybrid neighborhood search algorithm, which is based on the framework of the adaptive large neighborhood search algorithm. The proposed algorithm incorporates various problem-oriented search operators being adaptively chosen for evolution. Meanwhile, dynamic programming-based charging approaches for both full and partial charging policies are presented. Numerical experiments are conducted using benchmark instances of the electric vehicle pickup and delivery problem to verify the effectiveness of our algorithm configurations and its overall performance. The solution results are compared against those obtained using the state-of-the-art algorithm, and the proposed algorithm identifies 21 new best solutions and exhibits greater stability, which demonstrates the competitiveness of the proposed algorithm. Furthermore, the analysis of charging policies provides interesting insights, highlighting the significant advantage of the partial charging policy in scenarios characterized by clustered customer distributions or short scheduling horizons.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102042\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225002007\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002007","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

环境压力和措施正在迫使电动汽车广泛整合到运输和物流系统中。本文主要研究具有时间窗口和部分充电的电动汽车取货问题,其中充电站的充电电量是灵活的,并根据路线计划来确定。针对这一问题,提出了一种新的有效的混合整数线性规划模型。为了有效地处理大规模实例,在自适应大邻域搜索算法框架的基础上,提出了一种自适应混合邻域搜索算法。该算法结合了各种面向问题的搜索算子,并根据进化需要自适应选择。同时,提出了基于动态规划的全计费策略和部分计费策略的计费方法。以电动汽车取货问题为例,进行了数值实验,验证了算法配置的有效性和整体性能。结果表明,该算法识别出21个新的最优解,并表现出更大的稳定性,证明了该算法的竞争力。此外,对收费策略的分析提供了有趣的见解,突出了部分收费策略在集群客户分布或较短调度周期的场景中的显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An adaptive hybrid neighborhood search algorithm for the electric vehicle pickup and delivery problem with time windows and partial charging
Environmental pressures and measures are compelling the extensive integration of electric vehicles into transportation and logistics systems. This paper focuses on addressing the electric vehicle pickup and delivery problem with time windows and partial charging, in which the amount of charging electricity at charging stations is flexible and determined based on the route schedules. A new effective mixed-integer linear programming model has been developed for the problem. To effectively tackle large-scale instances, we propose an adaptive hybrid neighborhood search algorithm, which is based on the framework of the adaptive large neighborhood search algorithm. The proposed algorithm incorporates various problem-oriented search operators being adaptively chosen for evolution. Meanwhile, dynamic programming-based charging approaches for both full and partial charging policies are presented. Numerical experiments are conducted using benchmark instances of the electric vehicle pickup and delivery problem to verify the effectiveness of our algorithm configurations and its overall performance. The solution results are compared against those obtained using the state-of-the-art algorithm, and the proposed algorithm identifies 21 new best solutions and exhibits greater stability, which demonstrates the competitiveness of the proposed algorithm. Furthermore, the analysis of charging policies provides interesting insights, highlighting the significant advantage of the partial charging policy in scenarios characterized by clustered customer distributions or short scheduling horizons.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信