A hybrid metaheuristic approach for the capacitated vehicle routing problem with container loading constraints

Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix

“…. , |A| { } do (13) if(i ≠ j) (14) update save matrix(↓↑A, ↓i, ↓j, ↓t x ) (15) end ( 16) end (17) end (18) s � find max save(↓A, ↓|A|) (19) end (20) end ALGORITHM 5: Route reduction. (1) Total cost is the overall cost incurred in the transportation process, considering factors such as travel costs, servicing costs, waiting costs, and vehicle deployment costs (2) Cost per pallet is the cost associated with transporting each pallet, providing insights into the effciency of cost allocation (3) Total length is the length of optimized routes, representing the total distance travelled by the vehicles (4) Te number of processed orders is the count of delivery orders that were successfully processed and incorporated into the optimized routes (5) Te number of delivered pallets is the count of pallets that were successfully transported on the optimized routes (6) Te number of remaining orders is the count of orders that were not included in the optimized routes due to capacity constraints.…”

“…Metaheuristics, either independently or in conjunction with the Clarke and Wright algorithm, have been applied to solve problems across various application areas. For instance, Escobar et al [18] utilized a hybrid approach to the VRP; here, they initially found the problem solution using the Clarke and Wright algorithm and then optimized it using tabu search metaheuristics. Addressing the mail delivery problem, Huang et al [19] developed two integer models for the delivery service.…”