A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

DOI10.1016/J.EJOR.2021.12.050MaRDI QIDQ2140338zbMATH OpenOpenAlexWikidataFDO

Authors Xiangyi Zhang, Lu Chen, Michel Gendreau, André Langevin

Publication date 20 May 2022

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

Full work available at URL https://doi.org/10.1016/j.ejor.2021.12.050

zbMATH Keywords

branch and cutcontraction algorithmroutingtwo-dimensional loading constraints

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints

Cites work

• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
• A branch and bound algorithm for the strip packing problem
• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A new approach to the minimum cut problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• An approach to the asymmetric multi-depot capacitated arc routing problem
• An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
• An exact algorithm for the two-dimensional strip-packing problem
• An exact approach to the strip-packing problem
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Combinatorial Benders' cuts for the strip packing problem
• Computer Codes for Problems of Integer Programming
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• scientific article; zbMATH DE number 437525 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1749220 (Why is no real title available?)
• The value of integrating loading and routing
• Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
• Vehicle routing problems with loading constraints: state-of-the-art and future directions

Cited in

(16)

• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• The enhanced tabu search algorithm for solving low-carbon vehicle routing problem with two-dimensional box constraints
• Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• Column generation-based matheuristic for pickup and delivery problem with two-dimensional loading
• Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
• A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
• On vehicle routing problems with loading constraints
• A hierarchical divide-and-conquer neural approach for multiple traveling salesman problems
• Pickup and delivery with time windows and two-dimensional loading for shipbuilding block transportation

Describes a project that uses

Uses Software

• VRP
• CVRPSP

This page was built for publication: A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

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