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 structur...
[1]
P. A. Jensen,et al.
A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem
,
1977
.
[2]
D. R. Fulkerson,et al.
Flows in Networks.
,
1964
.
[3]
Maurice Snowdon,et al.
Network Flow Programming
,
1980
.
[4]
E. P. Durbin,et al.
THE OUT-OF-KILTER ALGORITHM: A PRIMER
,
1967
.
[5]
D. R. Fulkerson,et al.
An Out-of-Kilter Method for Minimal-Cost Flow Problems
,
1960
.
[6]
R J Clasen.
THE NUMERICAL SOLUTION OF NETWORK PROBLEMS USING THE OUT-OF-KILTER ALGORITHM
,
1968
.
[7]
E. Downey Brill,et al.
A Branch and Bound Method for use in planning regional wastewater treatment systems
,
1978
.
[8]
John Huston.
Hydraulic dredging: theoretical and applied
,
1970
.