Answers are grounded in this paper and cite their sources.
This study addresses the Vehicle Routing Problem with Three-Dimensional Loading Constraints and Uncertain Time Windows (3L-CVRPTW) by integrating grey system theory for modelling delivery time uncertainty. A multi-objective grey chance-constrained programming model is formulated to optimise logistics costs and customer satisfaction under stochastic travel times. To tackle the NP-hard complexity, a hybrid heuristic algorithm is proposed, combining an improved quantum evolutionary algorithm for route optimisation with a local search-based three-dimensional loading feasibility checker. Five benchmark instances, extended from Gendreau’s dataset with grey time windows, are used to validate the approach. Experimental results demonstrate that the algorithm effectively balances cost efficiency and service reliability, with an average cost increase of 8.5% when satisfaction thresholds rise from 0.5 to 1. Additionally, the novel three-dimensional loading rules significantly reduce computational complexity. This framework provides a decision-making paradigm for logistics operators, harmonising operational stability and economic objectives under real-world constraints, thereby advancing methodological integration in stochastic vehicle routing research.
No takes yet. Share an insight, caveat, or question.
Yuan et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: