Robust Data-Driven Vehicle Routing with Time Windows
From MaRDI portal
Publication:4994169
DOI10.1287/opre.2020.2043zbMath1466.90017OpenAlexW3129335301MaRDI QIDQ4994169
Yu Zhang, Melvyn Sim, Zhenzhen Zhang, Andrew E. B. Lim
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.2043
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)
Related Items (5)
Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Distributionally robust equilibrious hybrid vehicle routing problem under twofold uncertainty ⋮ Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework ⋮ A bibliometric and social network analysis of data-driven heuristic methods for logistics problems
Uses Software
Cites Work
- Unnamed Item
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A vehicle routing problem with flexible time windows
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The robust vehicle routing problem with time windows
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An exact solution framework for a broad class of vehicle routing problems
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Vehicle routing problem with time windows and a limited number of vehicles.
- The sample average approximation method applied to stochastic routing problems: a computational study
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Routing optimization with time windows under uncertainty
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- A unified solution framework for multi-attribute vehicle routing problems
- Ensuring service levels in routing problems with time windows and stochastic travel times
- The Truck Dispatching Problem
- Routing Optimization Under Uncertainty
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Robust Approximation to Multiperiod Inventory Management
- TRACTABLE ROBUST EXPECTED UTILITY AND RISK MODELS FOR PORTFOLIO OPTIMIZATION
- An Economic Index of Riskiness
- A Robust Optimization Approach to Inventory Theory
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Vehicle routing with soft time windows and Erlang travel times
- The Price of Robustness
- A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- The Vehicle Routing Problem with Stochastic Travel Times
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Technical Note—Closed-Form Solutions for Worst-Case Law Invariant Risk Measures with Application to Robust Portfolio Optimization
This page was built for publication: Robust Data-Driven Vehicle Routing with Time Windows
