A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
This paper proposes a matheuristic algorithm based on a column generation structure for the capacitated vehicle routing problem with three-dimensional loading constraints (3L–CVRP). In the column generation approach, the master problem is responsible for managing the selection of best-set routes. In contrast, the slave problem is responsible for solving a shorter restricted route problem (CSP, Constrained Shortest Path) for generating columns (feasible routes). The CSP is not necessarily solveddoi:10.5267/j.ijiec.2022.1.002 fatcat:rijrk7qzqbg6zgkcaeelh33ar4