Distribution Strategies that Minimize Transportation and Inventory Costs

This paper develops an analytic method for minimizing the cost of distributing freight by truck from a supplier to many customers. It derives formulas for transportation and inventory costs, and determines the optimal trade-off between these costs. The paper analyzes and compares two distribution strategies: direct shipping i.e., shipping separate loads to each customer and peddling i.e., dispatching trucks that deliver items to more than one customer per load. The cost trade-off in each strategy depends on shipment size. Our results indicate that, for direct shipping, the optimal shipment size is given by the economic order quantity EOQ model, while for peddling, the optimal shipment size is a full truck. The peddling cost trade-off also depends on the number of customers included on a peddling route. This trade-off is evaluated analytically and graphically. The focus of this paper is on an analytic approach to solving distribution problems. Explicit formulas are obtained in terms of a few easily measurable parameters. These formulas require the spatial density of customers, rather than the precise locations of every customer. This approach simplifies distribution problems substantially while providing sufficient accuracy for practical applications. It allows cost trade-offs to be evaluated quickly using a hand calculator, avoiding the need for computer algorithms and mathematical programming techniques. It also facilitates sensitivity analyses that indicate how parameter value changes affect costs and operating strategies.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  W. Turner,et al.  Transportation Routing Problem—A Survey , 1974 .

[3]  D. Blumenfeld,et al.  Analyzing trade-offs between transportation, inventory and production costs on freight networks , 1985 .

[4]  James H Banks,et al.  Design Methodology for Airport Limousine Service , 1982 .

[5]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[6]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  S. Karlin,et al.  Studies in the Mathematical Theory of Inventory and Production, by K.J. Arrow, S. Karlin, H. Scarf with contributions by M.J. Beckmann, J. Gessford, R.F. Muth. Stanford, California, Stanford University Press, 1958, X p.340p., $ 8.75. , 1959, Bulletin de l'Institut de recherches économiques et sociales.

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

[9]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[10]  Carlos F. Daganzo,et al.  The length of tours in zones of different shapes , 1984 .

[11]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

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

[13]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[14]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[15]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[16]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[17]  V. Hurdle,et al.  An Operating Strategy for a Commuter Bus System , 1975 .

[18]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.