A Hybrid Parti cle Swarm Opti mizati on – Travelling Salesman Problem for Effi cient Multi Depot Vehicle Routi ng

Abstract

The Fast-Moving Consumer Goods (FMCG) industry faces increasing demand to opti mize distributi on networks to reduce costs. The company seeks to establish a proper redistributi on route network, opti mize truck allocati on, and minimize warehouse operati ons, administrati on, and transportati on costs while adhering to capacity and volume constraints. To achieve this, the study formulates the problem as a Multi -Depot Vehicle Routi ng Problem (MDVRP) with 3 depots. The proposed model with the additi on of a parti cle swarm algorithm yields a substanti al cost reducti on of 21.41% compared to the existi ng system, demonstrati ng the potenti al of hybrid metaheuristi c algorithms for addressing complex logisti cs challenges in the FMCG industry.