A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
From MaRDI portal
Publication:6187233
DOI10.1111/itor.13382OpenAlexW4387433685MaRDI QIDQ6187233
Bin Ji, Unnamed Author, Samson S. Yu, Dezhi Zhang
Publication date: 31 January 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13382
Cites Work
- Unnamed Item
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Efficient elementary and restricted non-elementary route pricing
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- 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
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- A new exact method for the two-dimensional orthogonal packing problem
- The Truck Dispatching Problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Vehicle Routing
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Routing with time windows by column generation
- An algorithm for the resource constrained shortest path problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Shortest Path Problems with Resource Constraints
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
This page was built for publication: A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
