Abstract
The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse), suitable tosolve problems in cases with up to 50 users.References
(Balinski et al. 1964) Balinski, M., Quandt, R. On an integer
program for delivery problem. Operations Research,
:300-304, 1964.
(Gavish et al. 1979) Gavish, B., Graves, S., The travelling
salesman problem and related problems, Working Paper
, Graduate School of Management, University of
Rochester, Rochester, NY 1979.
(Gavish et al. 1982) Gavish, B., Graves, S., Scheduling and
routing in transportation and distributions systems: Formulations
and new relaxation. Working Paper, Graduate
School of Management, University ofRochester,
Rochester, NY 1982.
(Gavrin et al. 1957) Gavrin, W. M., Crandall, H. W., John, J.
B., Spellman, R. A. Applications of linear programming
in oil indW>try. Management Science, 3:407-430, 1957
(Fisher 1994) Fisher, M. L. Optimal solution of vehicle routing
problem W>ing k-trees, Operations Research, 42:626-
-642, 1994
(Miller 1995) Miller, D. L., A matching based algorithm for
capacitated vehicle routing problems, ORSA Journal on
Computing, 7(1): 1-9, 1995.
