Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design

This paper develops a model that is being used by the City of New York to design a new logistics system to transport municipal sewage sludge from city-operated wastewater treatment plants to a new ocean dumping site 106 miles offshore. The model provides an integrative framework for considering such strategic planning issues as fleet sizing, choice of vessel size, sizing local inventory holding capacities, and analyzing system behavior with and without transshipment. A unique feature of the model is that plant visitation frequencies are determined naturally by the characteristics of the problem (vessel size, inventory holding capacities, statistics of sludge production, proximity of other plants), rather than stated as exogeneous constraints. The formulation should be useful in a more general class of depot-to-customer distribution systems, including the distribution of industrial gases. The paper concludes with a description of additional research that is required in refining both the assumptions and the mechanisms of execution of the model.

[1]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

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

[3]  R. Russell,et al.  An assignment routing problem , 1979, Networks.

[4]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

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

[6]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[7]  Moshe Dror,et al.  Inventory/routing: Reduction from an annual to a short-period problem , 1987 .

[8]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[9]  Alan S. Minkoff Real-time dispatching of delivery vehicles , 1985 .

[10]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

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

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  A. J. Goldman Optimal Center Location in Simple Networks , 1971 .

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

[15]  Awi Federgruen,et al.  A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..

[16]  Bruce L. Golden,et al.  OR Forum - Perspectives on Vehicle Routing: Exciting New Developments , 1986, Oper. Res..