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

In this work, we introduce a hybrid metaheuristic approach for the 3L-CVRP. The proposed approach uses an initial solution obtained by a modified Clark & Wright algorithm considering the packing constraints by a GRASP scheme. Then, a Granular Tabu Search (GTS) algorithm is employed to improve the initial solution, meanwhile the GRASP approach validates the packing constraints during the search process. The proposed algorithm has been compared with the most effective algorithms proposed for the 3L-CVRP. Computational results show the effectiveness of the proposed approach.