An improved multiobjective evolutionary algorithm for time-dependent vehicle routing problem with time windows

IF 5 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jia-ke Li , Jun-qing Li , Ying Xu
{"title":"An improved multiobjective evolutionary algorithm for time-dependent vehicle routing problem with time windows","authors":"Jia-ke Li ,&nbsp;Jun-qing Li ,&nbsp;Ying Xu","doi":"10.1016/j.eij.2024.100574","DOIUrl":null,"url":null,"abstract":"<div><div>Time-dependent vehicle routing problem with time windows (TDVRPTW) is a pivotal problem in logistics domain. In this study, a special case of TDVRPTW with temporal-spatial distance (TDVRPTW-TSD) is investigated, which objectives are to minimize the total travel time and maximize customer satisfaction while satisfying the vehicle capacity. To address it, an improved multiobjective evolutionary algorithm (IMOEA) is developed. In the proposed algorithm, a hybrid initialization strategy with two efficient heuristics considering temporal-spatial distance is designed to generate high-quality and diverse initial solutions. Then, two crossover operators are devised to broaden the exploration space. Moreover, an efficient local search heuristic combing the adaptive large neighborhood search (ALNS) and the variable neighborhood descent (VND) is developed to improve the exploration capability. Finally, detailed comparisons with several state-of-the-art algorithms are tested on a set of instances, which verify the efficiency and effectiveness of the proposed IMOEA.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"28 ","pages":"Article 100574"},"PeriodicalIF":5.0000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866524001373","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Time-dependent vehicle routing problem with time windows (TDVRPTW) is a pivotal problem in logistics domain. In this study, a special case of TDVRPTW with temporal-spatial distance (TDVRPTW-TSD) is investigated, which objectives are to minimize the total travel time and maximize customer satisfaction while satisfying the vehicle capacity. To address it, an improved multiobjective evolutionary algorithm (IMOEA) is developed. In the proposed algorithm, a hybrid initialization strategy with two efficient heuristics considering temporal-spatial distance is designed to generate high-quality and diverse initial solutions. Then, two crossover operators are devised to broaden the exploration space. Moreover, an efficient local search heuristic combing the adaptive large neighborhood search (ALNS) and the variable neighborhood descent (VND) is developed to improve the exploration capability. Finally, detailed comparisons with several state-of-the-art algorithms are tested on a set of instances, which verify the efficiency and effectiveness of the proposed IMOEA.
一种改进的多目标进化算法,用于解决具有时间窗口的时间相关车辆路由问题
有时间窗的时间相关车辆路由问题(TDVRPTW)是物流领域的一个关键问题。本研究探讨了具有时空距离的 TDVRPTW(TDVRPTW-TSD)的一个特例,其目标是在满足车辆容量的前提下,使总行驶时间最小化,客户满意度最大化。为此,开发了一种改进的多目标进化算法(IMOEA)。在所提出的算法中,设计了一种混合初始化策略,其中包含两个考虑到时间-空间距离的高效启发式算法,以生成高质量和多样化的初始解。然后,设计了两个交叉算子来拓宽探索空间。此外,还开发了一种结合自适应大邻域搜索(ALNS)和可变邻域下降(VND)的高效局部搜索启发式,以提高探索能力。最后,在一组实例上与几种最先进的算法进行了详细的比较测试,从而验证了所提出的 IMOEA 的效率和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Egyptian Informatics Journal
Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research
CiteScore
11.10
自引率
1.90%
发文量
59
审稿时长
110 days
期刊介绍: The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.
×
引用
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学术官方微信