This is the authors' abstract. We don't add key points for this paper.
Strict loading requirements necessitating the consideration of three‐dimensional attributes of items and vehicles exist in specific vehicle routing scenarios. These requirements dictate the simultaneous generation of the loading plan and route of each vehicle, that is, solving the integration of the capacitated vehicle routing problem (CVRP) and the container loading problem (CVRP with three‐dimensional loading constraints, 3L‐CVRP). Over the two decades since the inception of the 3L‐CVRP, a substantial body of literature has emerged. These studies encompass diverse problem variants, modelling characteristics, and algorithmic approaches, while utilising varying benchmark instances. To systematise this expansive landscape, this study provides a comprehensive review structured as follows. First, existing 3L‐CVRP variants are distinguished and classified based on their routing and loading characteristics. Second, existing modelling frameworks are summarised and compared. Third, solution approaches, including routing and loading algorithms and methods for integrating them, are reviewed and classified. Finally, benchmark instances are summarised, detailing their scales, characteristics, applicable scenarios, and previous results. Based on this comprehensive synthesis, current challenges and promising future research directions are highlighted.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Chi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: