New optimality cuts for a single‐vehicle stochastic routing problem

In the Vehicle Routing literature, investigations have concentrated on problems in whichthe customer demands are known precisely. We consider an application in which the demandsare unknown prior to the creation of vehicle routes, but follow some known probabilitydistribution. Because of the variability in customer demands, it is possible that the actualtotal customer demand may exceed the capacity of the vehicle assigned to service thosecustomers. In this case, we have a route failure , and there is an additional cost related to thecustomer at which the vehicle stocks out. We aim to find routes that minimise the sum of thedistance travelled plus any additional expected costs due to route failure. Because of thedifficulty of this problem, this investigation only considers a single‐vehicle problem. Tofind optimal routes, the integer L‐shaped method is used. We solve a relaxed IP in which thedistance travelled is modelled exactly, but the expected costs due to route failure are approximated.Constraints are dynamically added to prevent subtours and to further improve therelaxation. Additional constraints (optimality cuts) are added which progressively form atighter approximation of the costs due to route failure. Gendreau et al. [6] apply a similarmethodology to a closely related problem. They add optimality cuts, each of which imposesa useful bound on the route failure cost for only one solution. In addition to that cut, wegenerate “general” optimality cuts, each of which imposes a useful bound on the route failurecost for many solutions. Computational results attesting to the success of this approach arepresented.

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

[2]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

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

[4]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[5]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[6]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[7]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .

[8]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

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

[10]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[11]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

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

[13]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[14]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[15]  Shirley Dex,et al.  JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .

[16]  L. Bodin ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

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

[18]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[19]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..