<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ctm a22000004a 4500</leader>
  <controlfield tag="001">UP-99796217610395987</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20120706085730.0</controlfield>
  <controlfield tag="006">m    |o  d |      </controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">120706s2007    xx     d     r    |||| u|</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPD-00187104160</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DML</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
   <subfield code="a">DMLUC</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
   <subfield code="a">LG 995 2007 A64</subfield>
   <subfield code="b">D45</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">De Jesus, Ma. Rosario P.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A genetic algorithm solution to a large-scale power distribution network expansion planning problem</subfield>
   <subfield code="c">by Ma. Rosario P. De Jesus.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2007.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">xi, 125 leaves</subfield>
   <subfield code="b">ill.</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
   <subfield code="a">Thesis (M.S. Applied Mathematics)--University of the Philippines Diliman.</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper presents a simple yet efficient approach on how to implement genetic algorithm in solving a large-scale power distribution network expansion planning problem. The problem is to determine the siting and sizing of the substations and feeders to be built and upgrading of the sizes of the substations and feeders that are already existing or operational. Given the forecasted power demands at different locations, the goal is to find the substation and feeder layout or design with the least overall planning cost (comprising of investment and operational costs). Spanning trees were used to represent power distribution networks so that the problem constraint that the network must have no loops can be easily handled. Two crossover techniques for the genetic algorithm were implemented and compared in terms of the optimal objective function value obtained and the solution time. Another technique which is linearizing the feeder cost function was implemented to reduce solution time significantly.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Genetic Algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Electric power distribution.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Electric networks.</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DARCHIVES</subfield>
   <subfield code="h">LG 995 2007 A64 D45</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
