Advanced vehicle routing in cement distribution: a discrete Salp Swarm Algorithm approach
Vu Hong Son Pham, Nghiep Trinh Nguyen Dang, Nguyễn Văn Nam
Abstract
In this research, the focus is on addressing the capacitated vehicle routing problem (CVRP), a prominent logistical challenge within transportation management. The discrete salp swarm algorithm (DSSA) has been introduced as an innovative adaptation of the traditional salp swarm algorithm (SSA), specifically redesigned to cater to discrete characteristics inherent in problems like the CVRP. This algorithm integrates the core principles of SSA with mutation and crossover techniques, enhancing its applicability for discrete problems. The paper contributes in two main areas: firstly, the development of DSSA, tailored to address the unique requirements of VRP scenarios and ensuring a balanced approach between exploration and exploitation in discrete optimization. Secondly, the effectiveness of DSSA is demonstrated through practical applications, including an 8-customer routing task and a real-world case study involving cement delivery in Vietnam. In these scenarios, DSSA consistently demonstrates superior performance over other meta-heuristic strategies, marking a noteworthy advancement in the domain of optimization and providing a potential tool for complex routing challenges in logistics and distribution systems.