Robust vehicle routing under uncertainty via branch-price-and-cut

DOI10.1007/s11081-021-09680-6OpenAlexW3200212598MaRDI QIDQ2101653

Anirudh Subramanyam, Chrysanthos E. Gounaris, Akang Wang

Publication date: 6 December 2022

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-021-09680-6

zbMATH Keywords

vehicle routingrobust optimizationdemand uncertaintybranch-price-and-cuttravel time uncertaintyinfeasible path elimination constraintsrobust rounded capacity inequalities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (1)

Methodology and applications of robust optimization

Uses Software

• VRP

Cites Work

• Unnamed Item
• The robust vehicle routing problem with time windows
• A branch and bound algorithm for the capacitated vehicle routing problem
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Knapsack polytopes: a survey
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• The robust vehicle routing problem with time windows: solution by branch and price and cut
• Exact algorithms for the chance-constrained vehicle routing problem
• A generic exact solver for vehicle routing and related problems
• A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
• 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
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Lectures on Modern Convex Optimization
• A survey of resource constrained shortest path problems: Exact solution approaches
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
• Vehicle Routing
• Introduction to Stochastic Programming
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• 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
• The Price of Robustness
• 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
• New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
• Robust constrained shortest path problems under budgeted uncertainty
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
• The Distributionally Robust Chance-Constrained Vehicle Routing Problem
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Path inequalities for the vehicle routing problem with time windows
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Robust vehicle routing under uncertainty via branch-price-and-cut