Analysing risk orientation in a stochastic VRP

In this paper, the value of correctly addressing uncertainty and risk in operational planning is studied in the context of the Vehicle Routing Problem with Stochastic Demands (VRPSD). The main issues analysed in this paper concern (1) the evaluation of different risk attitudes in planning vehicle routes, (2) the value of considering the uncertainty for planning the vehicle routes (as opposed to dealing with the problem deterministically) in general and (3) the fit between the risk attitudes in performance measurement on the one hand and decision making on the other hand. Using an existing model of the VRPSD these issues are studied employing a heuristic solution approach based on Ant Colony Optimisation (ACO). [Received 20 July 2006; Revised 22 September; Accepted 17 October 2006].

[1]  Marc Reimann,et al.  Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..

[2]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  W. Sharpe,et al.  Mean-Variance Analysis in Portfolio Choice and Capital Markets , 1987 .

[5]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  Lawrence R. Jauch,et al.  Strategic management and business policy , 1980 .

[8]  Richard F. Hartl,et al.  Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection , 2004, Ann. Oper. Res..

[9]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[10]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

[11]  Marco Laumanns,et al.  Savings based ant colony optimization for the capacitated minimum spanning tree problem , 2006, Comput. Oper. Res..

[12]  Mauro Birattari,et al.  Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands , 2004, PPSN.

[13]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[14]  A. S. Kenyon,et al.  A survey on stochastic location and routing problems , 2001 .

[15]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[16]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[17]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

[18]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[19]  Karl F. Doerner,et al.  A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.

[20]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[21]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[22]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

[23]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[24]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[25]  Walter J. Gutjahr,et al.  Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization , 2005, SAGA.

[26]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[27]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[28]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[29]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[30]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[31]  Moshe Dror,et al.  Stochastic vehicle routing with modified savings algorithm , 1986 .

[32]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[33]  David Pisinger,et al.  A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..

[34]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

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

[36]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[37]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.