A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

DOI10.1002/net.20332zbMath1206.90016MaRDI QIDQ3057119

Louis-Martin Rousseau, Guy Desaulniers, Eric Prescott-Gagnon

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20332

zbMATH Keywords

vehicle routing; time windows; large neighborhood search; heuristic column generation

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

Related Items

Fuel emissions optimization in vehicle routing problems with time-varying speeds, The vehicle-routing problem with time windows and driver-specific times, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Hybrid column generation and large neighborhood search for the dial-a-ride problem, A powerful route minimization heuristic for the vehicle routing problem with time windows, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, The nuclear medicine production and delivery problem, Column-generation based bounds for the homogeneous areas problem, Synchronized routing of active and passive means of transport, A survey on matheuristics for routing problems, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems

Cites Work

• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A general heuristic for vehicle routing problems
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Vehicle routing problem with elementary shortest path based column generation
• A new ILP-based refinement heuristic for vehicle routing problems
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• 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
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A unified tabu search heuristic for vehicle routing problems with time windows
• Using constraint-based operators to solve the vehicle routing problem with time windows