USE OF CONTINUOUS SPACE MODELING TO ESTIMATE FREIGHT DISTRIBUTION COSTS

Abstract This paper develops an analytical framework for estimating the cost of distributing freight from one origin to many destinations. The origin and destinations each represent specific geographic locations, e.g., a supplier shipping to different retail outlets. Analytical estimates of freight distribution costs in the literature assume destinations have equal demand and are randomly located with uniform density. This research generalizes the techniques to account for spatial variations in the demand and density of destinations. General equations are derived for the two main cost components: the number of destination stops per load, and the distance traveled per load. Numerical examples are considered and compared to the simplest case of equal demand and uniform density. Results suggest that, for many practical situations, equations for the simplest case provide sufficiently accurate cost estimates. The analysis uses a continuous space modeling approach, which requires only the spatial density of destinations and the average and variance of demand, rather than data on the location and demand of each destination individually. This approach allows distribution costs to be determined analytically in terms of a few easily measured parameters.

[1]  R. J. Smeed,et al.  A Theoretical Model of Commuter Traffic in Towns , 1965 .

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

[3]  Randolph W. Hall,et al.  Distribution Strategies that Minimize Transportation and Inventory Costs , 1985, Oper. Res..

[4]  L. Kantorovitch,et al.  On the Translocation of Masses , 1958 .

[5]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[6]  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..

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

[8]  M. Beckmann A Continuous Model of Transportation , 1952 .

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

[10]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

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

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

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

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

[15]  Tadafumi Maejima An application of continuous spatial models to freight movements in Greater London , 1979 .

[16]  J. Wolfowitz,et al.  Introduction to the Theory of Statistics. , 1951 .

[17]  R. Smeed The Traffic Problem in Towns , 1964 .