The split delivery vehicle routing problem with time windows and three-dimensional loading constraints

DOI10.3934/JIMO.2023102MaRDI QIDQ6065202zbMATH OpenOpenAlexFDO

Authors Miao Yan, Liang-Yong Chu, Xin-Cheng Wu

Publication date 11 December 2023

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2023102

zbMATH Keywords

adaptive large neighborhood searchgenetic algorithmsplit deliverythree-dimensional loading constraintsvehicle routing problem with time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The split delivery vehicle routing problem with three-dimensional loading constraints
• The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order

Cites work

• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
• A model‐based heuristic to the vehicle routing and loading problem
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• An integrated approach to the vehicle routing and container loading problems
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
• Finished-vehicle transporter routing problem solved by loading pattern discovery
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Packing first, routing second -- a heuristic for the vehicle routing and loading problem
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• Savings by Split Delivery Routing
• Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
• The split delivery vehicle routing problem with three-dimensional loading constraints
• The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
• The truck dispatching problem

This page was built for publication: The split delivery vehicle routing problem with time windows and three-dimensional loading constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065202)