Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints

DOI10.1016/J.COR.2024.106864MaRDI QIDQ6979020zbMATH OpenFDO

Authors Jushang Chi, Shiwei He, Rui Song

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106864

zbMATH Keywords

backward dynamic programmingbranch-and-price algorithmrelocationthree-dimensional loadingtransportation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
• A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
• A tree search method for the container loading problem with shipment priority
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An integrated approach to the vehicle routing and container loading problems
• An inverse optimization approach for a capacitated vehicle routing problem
• An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
• Designing vehicle routes for a mix of different request types, under time windows and loading constraints
• Heuristics for the container loading problem
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Modeling soft unloading constraints in the multi-drop container loading problem
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
• On the three-dimensional container packing problem under home delivery service
• 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
• Three-dimensional container loading models with cargo stability and load bearing constraints

This page was built for publication: Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints

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