Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen

DOI10.1016/j.cor.2020.105062zbMath1458.90078OpenAlexW3048247178MaRDI QIDQ2664412

Reinaldo Morabito, Jonathan De La Vega, Pedro Augusto Munari

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105062

zbMATH Keywords

uncertaintyrobust optimizationroutingbranch-price-and-cutmultiple deliverymen

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (3)

An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands ⋮ Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time ⋮ A robust optimization approach for the unrelated parallel machine scheduling problem

Cites Work

• Unnamed Item
• Large-scale optimization with the primal-dual column generation method
• Robust combinatorial optimization with variable cost uncertainty
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• The robust vehicle routing problem with time windows
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
• An exact solution framework for a broad class of vehicle routing problems
• Robust discrete optimization and network flows
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• The robust vehicle routing problem with time windows: solution by branch and price and cut
• Robust combinatorial optimization with variable budgeted uncertainty
• New developments in the primal-dual column generation technique
• Robust optimization for the vehicle routing problem with multiple deliverymen
• Solving elementary shortest-path problems as mixed-integer programs
• Deriving robust counterparts of nonlinear uncertain inequalities
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• 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
• Theory and Applications of Robust Optimization
• Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
• Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• The Price of Robustness
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Robust constrained shortest path problems under budgeted uncertainty
• Shortest Path Problems with Resource Constraints
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen