Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty

DOI10.1287/opre.2020.2009zbMath1466.90013OpenAlexW3111483745MaRDI QIDQ4994141

Chrysanthos E. Gounaris, José M. Laínez-Aguirre, Anirudh Subramanyam, Frank Mufalli, José M. Pinto

Publication date: 17 June 2021

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2020.2009

zbMATH Keywords

vehicle routingrobust optimizationbranch-and-cuttwo-stage problemsmultiperiod planningrolling-horizon simulationsuncertain customer orders

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (4)

Dynamic multi-period vehicle routing with touting ⋮ The decision rule approach to optimization under uncertainty: methodology and applications ⋮ A Lagrangian dual method for two-stage robust optimization with binary uncertainties ⋮ Robust vehicle routing under uncertainty via branch-price-and-cut

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms for mixed-integer bilevel min-max optimization
• The dynamic multiperiod vehicle routing problem with probabilistic information
• A branch-and-price approach for a multi-period vehicle routing problem
• Multi-period vehicle routing problem with due dates
• The robust vehicle routing problem with time windows
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
• Approximation algorithms for time constrained scheduling
• Tractable stochastic analysis in high dimensions via robust optimization
• The dynamic dispatch waves problem for same-day delivery
• Delivery strategies for blood products supplies
• The vehicle routing problem. Latest advances and new challenges.
• Easy and difficult objective functions for max cut
• Adjustable robust solutions of uncertain linear programs
• Data-driven robust optimization
• Binary decision rules for multistage adaptive mixed-integer optimization
• A dynamic vehicle routing problem with multiple delivery routes
• Heuristics and lower bounds for the bin packing problem with conflicts
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The dynamic multi-period vehicle routing problem
• Routing optimization with time windows under uncertainty
• A multi-period TSP with stochastic regular and urgent demands
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment
• Routing Optimization Under Uncertainty
• Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
• Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Vehicle Routing
• Introduction to Stochastic Programming
• An Exact Algorithm for the Period Routing Problem
• Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
• Theory and Applications of Robust Optimization
• Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
• K-Adaptability in Two-Stage Robust Binary Programming
• The Period Vehicle Routing Problem and its Extensions
• Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics
• The Price of Robustness
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Facets of the knapsack polytope
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Partially dynamic vehicle routing—models and algorithms
• Finite Adaptability in Multistage Linear Optimization
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers

This page was built for publication: Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty