Advanced loading constraints for 3D vehicle routing problems

Abstract Given automated order systems, detailed characteristics of items and vehicles enable the planning deliveries including more efficient safer loading distribution vehicles. Many vehicle routing approaches ignore complex constraints. This paper focuses on comprehensive evaluation constraints in context combined Capacitated Vehicle Routing Problem 3D Loading (3L-CVRP) its extension with time windows (3L-VRPTW). To best our knowledge, this considers currently largest number meeting real-world requirements reducing unnecessary efforts for both problem variants. We introduce an approach load bearing strength ensuring a realistic between items. Moreover, we provide new variant robust stability constraint enabling better performance higher stability. In addition, consider axle weights to prevent overloaded axles first 3L-VRPTW. Additionally, reachability items, balanced manual unloading are taken into account. All implemented deepest-bottom-left-fill algorithm, which is embedded outer adaptive large neighbourhood search tackling Problem. A set 600 instances created, published used evaluate all terms solution quality performance. The efficiency hybrid algorithm evaluated by three well-known instance sets. outperform benchmarks most sets from literature. Detailed results implementation online.