Dredged‐Material Disposal Management Model
Publication: Journal of Water Resources Planning and Management
Volume 110, Issue 1
Abstract
To identify efficient dredged‐material disposal management strategies for the Delaware River navigation system near Philadelphia, the system operation problem is formulated and solved as a generalized minimum cost network flow programming problem. This formulation represents material sources and available disposal sites as nodes of the network and transportation links and carry‐over storages as arcs. The dewatering, consolidation, and densification of dredged material is modeled with an arc gain factor, thereby allowing reduction of the total volume of material within the network but requiring use of a network‐with‐gains algorithm for solution of the operation problem. Application of the model defines cost‐efficient dynamic schemes for allocation of material to available disposal sites. A generalized computer program was developed to define automatically the nodes, arcs, and parameters of the arcs of the network, given a description of the dredged‐material disposal system. Structured analysis and structured programming techniques were used, thus providing a clear definition of the computations required, the order in which they must be accomplished, and the flow of data. This software development technique reduces the effort required for subsequent modification of the program to analyze the system capacity‐expansion problem.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Boehm, B. W., “Software Engineering,” Classics in Software Engineering, E. N. Yourdon, ed., Yourdon Press, New York, N.Y., 1979.
2.
Brill, E. D., and Nakamura, M., “A Branch and Bound Method for Use in Planning Regional Wastewater Treatment Systems,” Water Resources Research, Vol. 14, No. 1, Feb., 1978, pp. 109–118.
3.
Corps of Engineers, U.S. Army, “Dredged Material Research Program Executive Overview and Detailed Summary,” U.S. Army Engineer Waterways Experiment Station, Vicksburg, Mich., Dec., 1978.
4.
Corps of Engineers, U.S. Army, “Delaware River Dredging Disposal Study, Stage 1 Reconnaissance Report,” U.S. Army Engineer District, Philadelphia, Pa., June, 1979.
5.
Classen, R. J., “The Numerical Solution of Network Problems Using the Out‐of‐Kilter Algorithm,” Rand Memorandom RM‐5456‐PR, Santa Monica, Calif., 1968.
6.
Demarco, T., “Structured Analysis and System Specification,” Classics in Software Engineering, E. N. Yourdon, ed., Yourdon Press, New York, N.Y., 1979.
7.
Durbin, E. P., and Kroenke, D. M., “The Out‐of‐Kilter Algorithm: A Primer,” Rand Memorandum RM‐5472‐PR, Santa Monica, Calif., 1967.
8.
Ford, L. R., and Fulkerson, D. R., Flows in Networks, Princeton University Press, Princeton, N.J., 1962.
9.
Fulkerson, D. R., “An Out‐of‐Kilter Method for Solving Minimal Cost Flow Problems,” Society of Industrial and Applied Mathematics Journal of Applied Mathematics, Vol. 9, 1961, pp. 18–27.
10.
Huston, J., Hydraulic Dredging: Theoretical and Applied, Cornell Maritime Inc., Cambridge, Mass., 1970.
11.
Jensen, P. A., and Bhaumik, G., “A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem,” Management Science, Vol. 23, 1977, pp. 631–643.
12.
Jensen, P. A., and Barnes, J. W., Network Flow Programming, John Wiley and Sons, Inc., New York, N.Y., 1980.
13.
Marks, D. H., and Liebman, J. C., “Mathematical Analysis of Solid Waste Collection,” Public Health Service Publication No. 2104, U.S. Department Health, Education, and Welfare, Washington, D.C., 1970.
14.
Texas Water Development Board, “AL‐V Surface Water Resources Allocation Model,” UM‐35, Austin, Tex., 1981.
Information & Authors
Information
Published In
Copyright
Copyright © 1984 ASCE.
History
Published online: Jan 1, 1984
Published in print: Jan 1984
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.