A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order

This paper extends the results of a particular capacitated vehicle routing problem with pickups and deliveries (see Pandelis et al., 2013b) to the case in which the demands for a material that is delivered to N customers and the demands for a material that is collected from the customers are continuous random variables instead of discrete ones. The customers are served according to a particular order. The optimal policy that serves all customers has a specific threshold-type structure and it is computed by a suitable efficient dynamic programming algorithm that operates over all policies having this structure. The structural result is illustrated by a numerical example.

[1]  Ioannis Minis,et al.  Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence , 2011, Eur. J. Oper. Res..

[2]  Michel Gendreau,et al.  A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[3]  H. Tijms.  A First Course in Stochastic Models , 2003 .

[4]  Bo Guo,et al.  The capacitated vehicle routing problem with stochastic demands and time windows , 2011, Comput. Oper. Res..

[5]  Dimitrios G. Pandelis,et al.  Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands , 2012, Eur. J. Oper. Res..

[6]  E. R. Petersen.  STOCHASTIC VEHICLE ROUTING PROBLEM WITH RESTOCKING. , 2000 .

[7]  Gilbert Laporte,et al.  Designing delivery districts for the vehicle routing problem with stochastic demands , 2007, Eur. J. Oper. Res..

[8]  Nicola Secomandi,et al.  Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..

[9]  Barrett W. Thomas,et al.  Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand , 2012, Eur. J. Oper. Res..

[10]  Magdalene Marinaki,et al.  Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands , 2013, Appl. Soft Comput..

[11]  Dimitrios G. Pandelis,et al.  Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery , 2013, Eur. J. Oper. Res..

[12]  Kay Chen Tan,et al.  Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation , 2007, Eur. J. Oper. Res..

[13]  Ioannis Minis,et al.  Single vehicle routing with a predefined customer sequence and multiple depot returns , 2008, Eur. J. Oper. Res..

[14]  Ioannis Minis,et al.  Production , Manufacturing and Logistics Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns , 2009 .

[15]  Tito Homem-de-Mello,et al.  Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method , 2005, Ann. Oper. Res..

[16]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[17]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[18]  Dimitrios G. Pandelis,et al.  SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS , 2012, Probability in the Engineering and Informational Sciences.