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 , Hartono , Samsul A. Rahman Sidik Hasibuan , 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.