<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Efficiency of the branch-looped strategy for optimizing water distribution networks</title>
  </titleInfo>
  <name type="personal">
    <namePart>Yami, Vidhan R.</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Orth, H.M</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Vigneswaran, S.</namePart>
    <role>
      <roleTerm type="text">Co-Adviser</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Lohani, B.N.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>The Royal Netherlands Government</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1982</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>41, 19 p.</extent>
  </physicalDescription>
  <abstract>The purpose of this study is to find out which strategy is most economical in developing from a branched system to a looped system in a water distribution network. A given set of demand nodes can be connected in a  number of ways to form a network system, whether branched or looped. The  present study takes an existing water distribution network and makes linear programming optimization computer runs on them. The demand nodes of the  existing water distribution system are connected along the existing pipe sections to form minimum spanning tree, shortest path, and random path  branched networks and linear programming optimization computer runs are made on them. Then from each of the branched systems the looped systems are developed and again linear programming optimization computer runs are  made on these derived looped systems. The results are then studied to see which strategy is most efficient.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Environment, Resources and Development</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1982</note>
  <subject authority="lcsh">
    <topic>Tanning</topic>
    <topic>Waste disposal</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. EV-82-29</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B21211</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B21211</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">291098</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818095358.0</recordChangeDate>
  </recordInfo>
</mods>
