Faster rollout search for the vehicle routing problem with stochastic demands and restocking
From MaRDI portal
Publication:1651700
DOI10.1016/j.ejor.2018.03.034zbMath1403.90084OpenAlexW3123787136MaRDI QIDQ1651700
Nicola Secomandi, Luca Bertazzi
Publication date: 12 July 2018
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.03.034
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands ⋮ Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand ⋮ A vehicle routing problem with multiple service agreements ⋮ Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut ⋮ Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach ⋮ An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum and worst-case performance ratios of rollout algorithms
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Parallelization strategies for rollout algorithms
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Stochastic vehicle routing: A comprehensive approach
- The vehicle routing problem: An overview of exact and approximate algorithms
- Stochastic vehicle routing
- New optimality cuts for a single-vehicle stochastic routing problem
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Rollout algorithms for stochastic scheduling problems
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- The Truck Dispatching Problem
- Stochastic Vehicle Routing Problem with Restocking
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- Vehicle Routing
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A note on determining operating strategies for probabilistic vehicle routing
- New Rollout Algorithms for Combinatorial Optimization Problems
- Computational Approaches to Stochastic Vehicle Routing Problems
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Priori Optimization
- Modeling uncertainty. An examination of stochastic theory, methods, and applications
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Faster rollout search for the vehicle routing problem with stochastic demands and restocking
