An exact and metaheuristic optimization framework for solving Vehicle Routing Problems with Shipment Consolidation using population-based and Swarm Intelligence

Muhammad Khahfi Zuhanda , Hartono , Samsul A. Rahman Sidik Hasibuan , Yose Yefta Napitupulu
{"title":"An exact and metaheuristic optimization framework for solving Vehicle Routing Problems with Shipment Consolidation using population-based and Swarm Intelligence","authors":"Muhammad Khahfi Zuhanda ,&nbsp;Hartono ,&nbsp;Samsul A. Rahman Sidik Hasibuan ,&nbsp;Yose Yefta Napitupulu","doi":"10.1016/j.dajour.2024.100517","DOIUrl":null,"url":null,"abstract":"<div><div>The Vehicle Routing Problem with Shipment Consolidation (VRPSC) is a novel variation of the vehicle routing problem that involves multiple commodities, multiple dimensions, a fleet with different types of vehicles, and the challenge of consolidating shipments during the route. Exact algorithms have been suggested to solve the VRPSC problems. Besides exact algorithms, specific metaheuristic algorithms are employed to deliver solutions of superior quality, albeit not necessarily optimal. The Artificial Immune System (AIS) and Genetic Algorithm (GA) are the metaheuristic optimization techniques applied in this research. Genetic programming is included in evolutionary computing, while AIS is included in swarm intelligence. This research presents a vehicle routing model with product consolidation and different product dimensions. These criteria were selected due to their significant impact on the complexity of mathematical problem-solving in VRPSC. The results from applying these metaheuristic algorithms will be compared with those of exact algorithms to compare and analyse different VRPSC solution approaches.</div></div>","PeriodicalId":100357,"journal":{"name":"Decision Analytics Journal","volume":"13 ","pages":"Article 100517"},"PeriodicalIF":0.0000,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Decision Analytics Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772662224001218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Vehicle Routing Problem with Shipment Consolidation (VRPSC) is a novel variation of the vehicle routing problem that involves multiple commodities, multiple dimensions, a fleet with different types of vehicles, and the challenge of consolidating shipments during the route. Exact algorithms have been suggested to solve the VRPSC problems. Besides exact algorithms, specific metaheuristic algorithms are employed to deliver solutions of superior quality, albeit not necessarily optimal. The Artificial Immune System (AIS) and Genetic Algorithm (GA) are the metaheuristic optimization techniques applied in this research. Genetic programming is included in evolutionary computing, while AIS is included in swarm intelligence. This research presents a vehicle routing model with product consolidation and different product dimensions. These criteria were selected due to their significant impact on the complexity of mathematical problem-solving in VRPSC. The results from applying these metaheuristic algorithms will be compared with those of exact algorithms to compare and analyse different VRPSC solution approaches.
利用群体智能和蜂群智能解决货运整合车辆路线问题的精确和元智慧优化框架
带装运合并的车辆路由问题(VRPSC)是车辆路由问题的一种新变体,涉及多种商品、多个维度、不同类型车辆的车队,以及在路由过程中合并装运的挑战。有人提出了精确算法来解决 VRPSC 问题。除精确算法外,还采用了特定的元启发式算法来提供高质量的解决方案,尽管不一定是最优的。人工免疫系统(AIS)和遗传算法(GA)是本研究采用的元启发式优化技术。遗传编程属于进化计算,而人工免疫系统则属于群体智能。本研究提出了一个具有产品整合和不同产品维度的车辆路由模型。之所以选择这些标准,是因为它们对 VRPSC 中数学问题解决的复杂性有重大影响。应用这些元启发式算法得出的结果将与精确算法的结果进行比较,从而对不同的 VRPSC 解决方法进行比较和分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.90
自引率
0.00%
发文量
0
×
引用
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学术官方微信