The robust vehicle routing problem with time windows: solution by branch and price and cut

DOI10.1016/j.ejor.2018.12.019zbMath1430.90104OpenAlexW2905390834WikidataQ128722919 ScholiaQ128722919MaRDI QIDQ1719626

Fatma Gzara, Da Lu

Publication date: 11 February 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.12.019

zbMATH Keywords

column generationvehicle routingbranch-and-price-and-cutrobust formulationuncertain demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (10)

Optimizing vehicle routing via Stackelberg game framework and distributionally robust equilibrium optimization method ⋮ The vehicle routing problem with time windows and evidential service and travel times: a recourse model ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ Column generation-based stochastic school bell time and bus scheduling optimization ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Vehicle routing with transportable resources: using carpooling and walking for on-site services ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut

Uses Software

• VRP

Cites Work

• The robust vehicle routing problem with time windows
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Robust discrete optimization and network flows
• A review of dynamic vehicle routing problems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Optimization over Integers with Robustness in Cost and Few Constraints
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The Stochastic Vehicle Routing Problem for Minimum Unmet Demand
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Robust constrained shortest path problems under budgeted uncertainty
• Vehicle Routing Problem with Time Windows

This page was built for publication: The robust vehicle routing problem with time windows: solution by branch and price and cut