KWRRI Research Reports
Archived
This content is available here strictly for research, reference, and/or recordkeeping and as such it may not be fully accessible. If you work or study at University of Kentucky and would like to request an accessible version, please use the SensusAccess Document Converter.
Abstract
A multiobjective branch-and-bound algorithm is proposed for use in analysing multiobjective fixed-charge network-flow problems which are found commonly in water resources planning situations. Also proposed is a multiobjective imputed value analysis which makes use of the branch-and-bound tree structure and allows the comparison of the importance of facilities in the network as represented by individual arcs or sets of arcs. The mathematical formulation and the analysis procedure of the method are described, and the potential usefulness of the method is demonstrated using two hypothetical example problems dealing with regional wastewater treatment and residual management systems. A FORTRAN program for implementing the algorithm is available from the first author.
Publication Date
1-1982
Issue Number
130
Digital Object Identifier (DOI)
https://doi.org/10.13023/kwrri.rr.130
Funding Information
The work upon which this report is based was supported in part by funds provided by the Office of Water Research and Technology, United States Department of the Interior, Washington, D.Co, as authorized by the Water Research and Development Act of 1978. Public Law 95-467.
Repository Citation
Nakamura, Masahisa; Alexander, Suraj M.; Riley, James M.; Simon, Robert; Meyer, Susan; and Bloemer, Kenneth F., "A Multiobjective Branch-and-Bound Method for Planning Wastewater and Residual Management Systems" (1982). KWRRI Research Reports. 73.
https://uknowledge.uky.edu/kwrri_reports/73
