An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy

2019 ◽  
Vol 273 (1) ◽  
pp. 175-189 ◽  
Author(s):  
Majid Salavati-Khoshghalb ◽  
Michel Gendreau ◽  
Ola Jabali ◽  
Walter Rei
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Restocking Policy

An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers

1995 ◽  
Vol 29 (2) ◽  
pp. 143-155 ◽  
Author(s):  
Michel Gendreau ◽  
Gilbert Laporte ◽  
René Séguin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Stochastic Demands

New Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands

2020 ◽  
Vol 54 (4) ◽  
pp. 1073-1090 ◽  
Author(s):  
Alexandre M. Florio ◽  
Richard F. Hartl ◽  
Stefan Minner
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Cost Effective ◽  
Stochastic Problem ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Deterministic Equivalent ◽  
New Findings ◽  
Vehicle Capacity

This paper considers the vehicle routing problem with stochastic demands under optimal restocking. We develop an exact algorithm that is effective for solving instances with many vehicles and few customers per route. In our experiments, we show that in these instances, solving the stochastic problem is most relevant (i.e., the potential gains over the deterministic equivalent solution are highest). The proposed branch-price-and-cut algorithm relies on an efficient labeling procedure, exact and heuristic dominance rules, and completion bounds to price profitable columns. Instances with up to 76 nodes could be solved in less than five hours, and instances with up to 148 nodes could be solved in long runs of the algorithm. The experiments also allowed new findings on the problem. The solution to the stochastic problem is up to 10% less costly than the deterministic equivalent solution. Opening new routes reduces restocking costs and in many cases results in solutions with less transportation costs. When the number of routes is not fixed, the optimal solutions under detour-to-depot and optimal restocking are nearly equivalent. However, when the number of routes is limited and the expected demand along a route is allowed to exceed the vehicle capacity, optimal restocking may be significantly more cost-effective than the detour-to-depot policy.

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

1995 ◽  
Vol 61 (1) ◽  
pp. 21-43 ◽  
Author(s):  
Eleni Hadjiconstantinou ◽  
Nicos Christofides ◽  
Aristide Mingozzi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Shortest Paths ◽  
Exact Algorithm ◽  
Routing Problem

Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands

2014 ◽  
Vol 50 ◽  
pp. 1-13 ◽  
Author(s):  
Lin Zhu ◽  
Louis-Martin Rousseau ◽  
Walter Rei ◽  
Bo Li
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands

Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

2014 ◽  
Vol 61 (2) ◽  
pp. 463-487 ◽  
Author(s):  
Prasanna Balaprakash ◽  
Mauro Birattari ◽  
Thomas Stützle ◽  
Marco Dorigo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Single Vehicle
Sign in / Sign up

Export Citation Format

Share Document