Abstract
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.
Similar content being viewed by others
References
D.J. Bertsimas, A vehicle routing problem with stochastic demand, Operations Research 40(1992)574-585.
L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Computers and Operations Research 10(1983)10.
G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research 12(1964)568-581.
M. Dror, G. Laporte and P. Trudeau, Vehicle routing with stochastic demands: Properties and solution frameworks, Transportation Science 23(1989)166-176.
M. Dror and P. Trudeau, Stochastic vehicle routing with modified savings algorithm, European Journal of Operations Research 23(1986)228-235.
M. Gendreau, G. Laporte and R. Séguin, An exact algorithm for the vehicle routing problem with stochastic demands and customers, Transportation Science 29(1995)143-155.
M. Gendreau, G. Laporte and R. Séguin, Stochastic vehicle routing, European Journal of Operations Research 88(1996)3-12.
M. Gendreau, G. Laporte and R. Séguin, A tabu search heuristic for the vehicle routing problem with stochastic demands and customers, Operations Research 44(1996)469-477.
M. Grötschel and O. Holland, A cutting plane algorithm for minimum perfect 2-matchings, Computing 39(1987)327-344.
M. Grötschel and O. Holland, Solution of large-scale symmetric travelling salesman problems, Mathematical Programming 51(1991)141-202.
P. Jaillet, A priori solution of a traveling salesman problem in which a random subset of the customers are visited, Operations Research 36(1988)929-936.
J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 71(1956)48-50.
G. Laporte, The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operations Research 59(1992)345-358.
G. Laporte, F. Louveaux and H. Mercure, The vehicle routing problem with stochastic travel times, Transportation Science 26(1992)161-170.
G. Laporte and F. V. Louveaux, The integer L-shaped method for stochastic integer programs with complete recourse, Operations Research Letters 13(1993)133-142.
G. Laporte, F.V. Louveaux and H. Mercure, A priori solution of a probabilistic traveling salesman tour, Operations Research 42(1994)543-549.
M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33(1991)60-100.
D.M. Ryan, ZIP — a zero-one integer programming package for scheduling, Technical Report CSS85, AERE, Harwell, 1980.
W.R. Stewart, Jr. and B.L. Golden, Stochastic vehicle routing: A comprehensive approach, European Journal of Operations Research 14(1983)371-385.
R.M. Van Slyke and R. Wets, L-shaped linear programs with applications to optimal control and stochastic programming, SIAM Journal of Applied Mathematics 17(1969)638-663.
Rights and permissions
About this article
Cite this article
Hjorring, C., Holt, J. New optimality cuts for a single‐vehicle stochastic routing problem. Annals of Operations Research 86, 569–584 (1999). https://doi.org/10.1023/A:1018995927636
Issue Date:
DOI: https://doi.org/10.1023/A:1018995927636