A vehicle routing problem with multiple service agreements

Cites Work

Unnamed Item
A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
Faster rollout search for the vehicle routing problem with stochastic demands and restocking
An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy
Self-imposed time windows in vehicle routing problems
Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
A concise guide to existing and emerging vehicle routing problem variants
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Further results on the probabilistic traveling salesman problem
The Vehicle Routing Problem
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
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
Vehicle-scheduling Problems with Uncertainty and Omitted Customers
A Priori Optimization of the Probabilistic Traveling Salesman Problem
Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands
Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
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 Vehicle Routing Problem with Stochastic Demand

This page was built for publication: A vehicle routing problem with multiple service agreements