Back to search

South Dakota State University

Network Optimization by Variance Reduction Analysis

Abstract

dc:description.abstract

The field of network design is a growing one. Sampling sites, sampling pattern and approaches are taken into consideration while designing a network. But sometimes modification of an existing network becomes essential, and requires addition or removal of some gages. In the present study, an optimal way is identified to solve this problem. Network optimization is an optimization problem. A Variance-based approach in which variance of estimation error i.e. , expected value of the squared difference between the true and the estimated value of a random variable, e.g., rainfall, is considered as an improving criteria. A conventional algorithm, Newton's method, is applied to find the optimal location for a new site. Results show that this algorithm fails to find the global optimum. An optimal search algorithm called branch and bound with underestimates, has been successfully applied here to find the optimal gages for removal. Overall, the proposed network design approach will provide a guideline to the future network designers.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis - University Access Only
Discipline thesis:degree_discipline
Civil and Environmental Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Moktader, MD. Abdul

Identifiers

dc:identifier.*
Repository record dc:identifier
https://openprairie.sdstate.edu/etd2/535

Chain of custody

source
Harvested from
South Dakota State University
Base URL
openprairie.sdstate.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Moktader, MD. Abdul. Network Optimization by Variance Reduction Analysis. Thesis - University Access Only thesis, https://openprairie.sdstate.edu/etd2/535