A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints

DOI10.1016/J.EJOR.2025.10.010MaRDI QIDQ7233769zbMATH OpenFDO

Authors Felix Tamke, Florian Linß, Leopold Kuttner, Udo Buscher

Publication date 27 April 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.10.010

zbMATH Keywords

branch-and-cutconstraint programmingcontainer loadingrouting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
• 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 new branch-and-cut algorithm for the capacitated vehicle routing problem
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• 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
• Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
• Constraints in container loading -- a state-of-the-art review
• Extreme point-based heuristics for three-dimensional bin packing
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• Packing first, routing second -- a heuristic for the vehicle routing and loading problem
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Solution validator and visualizer for (combined) vehicle routing and container loading problems
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• The exact solutions of several types of container loading problems
• The Meet-in-the-Middle Principle for Cutting and Packing Problems
• The pallet-loading vehicle routing problem with stability constraints
• 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 Three-Dimensional Bin Packing Problem
• The value of integrating loading and routing
• Variable neighborhood search: basics and variants
• Vehicle routing problems with loading constraints: state-of-the-art and future directions

This page was built for publication: A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints

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