Premium
A multiobjective branch and bound method for network‐structured water resources planning problems
Author(s) -
Nakamura Masahisa,
Riley James M.
Publication year - 1981
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/wr017i005p01349
Subject(s) - branch and bound , mathematical optimization , fortran , computer science , residual , upper and lower bounds , tree (set theory) , network planning and design , multi objective optimization , operations research , algorithm , mathematics , mathematical analysis , computer network , operating system
A multiobjective branch and bound algorithm is proposed for use in analyzing 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 a hypothetical example problem dealing with a regional wastewater treatment and residual management system. A Fortran program for implementing the algorithm is available from the first author.