Optimization of In-Plant Logistics Through a New Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Heterogeneous Fleet

• Published in: Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi
• Main Authors: Nevra Kazancı, Seçil Kulaç
• Format: Article
• Language: English
• Published: Sakarya University 2024-12-01
• Subjects: capacitated vehicle routing problem; in-plant logistics; simulated annealing algorithm; tabu search algorithm
• Online Access: https://dergipark.org.tr/en/download/article-file/3766464

The vehicle routing problem (VRP) is a crucial group of transportation problems, and traditional capacitated VRP (CVRP) directly handles external logistics with a homogeneous vehicle fleet. This paper examines the CVRP from an in-plant logistic view with a heterogeneous fleet in an automotive factory. The homogeneous and heterogeneous vehicle fleets are compared to address the factory's actual in-plant logistics issues. Firstly, simulated annealing (SA), tabu search (TS) algorithms and mathematical modeling were utilized. Then, a hybrid approach was proposed, and all suggested meta-heuristic algorithms were evaluated for homogeneous and heterogeneous vehicle fleets. According to the results, the reduction rates using CVRP with the heterogeneous fleet are 17% and 36% for fleet area and distribution costs, respectively. Also, to examine the effect of the hybrid algorithm parameters on the result, traveling distance was calculated for different scenarios, and multiple regression analyses were applied. According to the multiple regression analysis, the hybrid algorithm's most affected parameter was the cooling coefficient.