{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1539"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1539","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Network Optimization by Variance Reduction Analysis","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.","abstract_html":"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&#x27;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.","abstract_has_math":false,"creators":["Moktader, MD. Abdul"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Civil and Environmental Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:03:44Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/535","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/535","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd2-1539","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Moktader, MD. Abdul"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-03-08T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1996-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Civil and Environmental Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/535"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Network Optimization by Variance Reduction Analysis"]}]}],"canonical_facts":{"dc:creator":["Moktader, MD. Abdul"],"dc:date.available":["2023-03-08T08:00:00Z"],"dc:date.created":["1996-01-01T08:00:00Z"],"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."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/535"],"dc:title":["Network Optimization by Variance Reduction Analysis"],"thesis:degree_discipline":["Civil and Environmental Engineering"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:03:44Z"}