A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
DOI10.1016/J.EJOR.2021.12.050OpenAlexW4205537357WikidataQ113875431 ScholiaQ113875431MaRDI QIDQ2140338FDOQ2140338
André Langevin, Xiangyi Zhang, Lu Chen, Michel Gendreau
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Title not available (Why is that?)
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exact approach to the strip-packing problem
- A branch and bound algorithm for the strip packing problem
- 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
- A new approach to the minimum cut problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- Computer Codes for Problems of Integer Programming
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- The value of integrating loading and routing
Cited In (4)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
Uses Software
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)
