Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
The paper deals with a new integrated routing and loading problem (3L-VRPCB). 3L-VRPCB integrates vehicle routing with clustered backhauls and packing of 3D items. Two metaheuristics are proposed based on neighborhood search and tree search. Both metaheuristics are tested by means of 95 new 3L-VRPCB benchmark instances. Better metaheuristic shows also good results for well-known instances of 3L-CVRP.
vehicle routing with clustered backhauls transportation large neighborhood search variable neighborhood search