A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands

2010 ◽  
Vol 44 (1) ◽  
pp. 136-146 ◽  
Author(s):  
Walter Rei ◽  
Michel Gendreau ◽  
Patrick Soriano
Keyword(s):  
Monte Carlo ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Hybrid Monte Carlo ◽  
Local Branching ◽  
Stochastic Demands ◽  
Single Vehicle ◽  
Local Branching Algorithm

AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS

2009 ◽  
Vol 26 (02) ◽  
pp. 185-197 ◽  
Author(s):  
SELÇUK KÜRŞAT İŞLEYEN ◽  
ÖMER FARUK BAYKOÇ
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Test Problems ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Expected Length ◽  
Service Policy ◽  
Novel Model

In this paper, the Vehicle Routing Problem with Stochastic Demands (VRPSD) is considered where customer demands are normally distributed. We propose a new model for computing the expected length of a tour. Monte Carlo simulation is used to demonstrate the accuracy of the model on randomly generated test problems. It is assumed that the service policy is non-divisible, meaning that the entire demand at each customer must be served in a single visit by a unique vehicle.

A local branching matheuristic for the multi-vehicle routing problem with stochastic demands

2018 ◽  
Vol 25 (2) ◽  
pp. 215-245 ◽  
Author(s):  
Florent Hernandez ◽  
Michel Gendreau ◽  
Ola Jabali ◽  
Walter Rei
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Local Branching ◽  
Stochastic Demands
Sign in / Sign up

Export Citation Format

Share Document