A Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Three‐Dimensional Loading Constraints

The capacitated vehicle routing problem with three‐dimensional loading constraints combinescapacitated vehicle routing and three‐dimensional loading with additional packing constraints whichconcern, for example, unloading operations. An efficient hybrid algorithm including a tabu searchalgorithm for routing and a tree search algorithm for loading is introduced. Computational results arepresented for all publicly available test instances. Most of the best solutions previously reported inliterature have been improved while the computational effort is drastically reduced compared toother methods.