Robust optimization for the vehicle routing problem with multiple deliverymen
From MaRDI portal
Publication:2323425
DOI10.1007/s10100-017-0511-xOpenAlexW2775555551WikidataQ57719344 ScholiaQ57719344MaRDI QIDQ2323425
Reinaldo Morabito, Jonathan De La Vega, Pedro Augusto Munari
Publication date: 2 September 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0511-x
heuristicsuncertain demandstatic robust linear optimizationvehicle routing problem with multiple deliverymen
Related Items (7)
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ The robust multi-plant capacitated lot-sizing problem ⋮ An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands ⋮ A robust optimization approach for the unrelated parallel machine scheduling problem ⋮ Special issue: engineering digital transformation ⋮ Master production schedule using robust optimization approaches in an automobile second-tier supplier ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- On the power and limitations of affine policies in two-stage adaptive optimization
- Scatter search for the fleet size and mix vehicle routing problem with time windows
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- 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
- A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Introduction to Stochastic Programming
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Theory and Applications of Robust Optimization
- K-Adaptability in Two-Stage Robust Binary Programming
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The Price of Robustness
- A Vehicle Routing Problem with Stochastic Demand
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Robust optimization for the vehicle routing problem with multiple deliverymen
