Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints
From MaRDI portal
Publication:5087714
DOI10.1287/ijoc.2021.1110zbMath1492.90025OpenAlexW4205930499MaRDI QIDQ5087714
Xiangyi Zhang, André Langevin, Lu Chen, Michel Gendreau
Publication date: 1 July 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1110
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (3)
The drone-assisted pickup and delivery problem: an adaptive large neighborhood search metaheuristic ⋮ Territorial design for customers with demand frequency ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Logistic regression. A self-learning text. With contributions by Erica Rihl Pryor.
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Learning a classification of mixed-integer quadratic programming problems
- Accelerating the branch-and-price algorithm using machine learning
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
- The value of integrating loading and routing
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Cauchy and the gradient method
- Learning when to use a decomposition
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Exact solution techniques for two-dimensional cutting and packing
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Support vector machines: theory and applications.
- A new exact method for the two-dimensional orthogonal packing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- An Exact Approach to the Strip-Packing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A Machine Learning-Based Approximation of Strong Branching
This page was built for publication: Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints
