<?xml version="1.0" encoding="UTF-8"?>
<record
    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">

  <leader>02809nam a2200385   4500</leader>
  <controlfield tag="005">20260817162859.0</controlfield>
  <controlfield tag="008">080998         th                  eng  </controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">.b11494463</subfield>
  </datafield>
  <datafield tag="099" ind1=" " ind2="9">
    <subfield code="a">AIT Thesis no.CS-95-09</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Thida Aye</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Application of genetic algorithm techniques in VLSI physical design</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Bangkok :</subfield>
    <subfield code="b">Asian Institute of Technology,</subfield>
    <subfield code="c">1995</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">67 leaves +</subfield>
    <subfield code="e">1 online resource</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Thesis ;</subfield>
    <subfield code="v">no. CS-95-9</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Thesis (M.Eng.) - Asian Institute of Technology, 1995</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Channel Routing Problem (CRP) is an NP-hard optimization problem in detailed routing phase of the VLSI physical design. Genetic Algorithms are a new class of heuristic search and optimization strategies which have been applied successfully to find good solutions to several optimization problems. We have designed and implemented a genetic algorithm-based system to solve the CRP. Several well-known benchmark CRPs were solved using our GA-based router. It was shown that our system can produce solutions to the benchmark CRPs with the minimum number of used tracks as obtained by theory and other traditional non-GA routers. The fitness function of our system considers both the number of used tracks and the total length of vertical segments as the optimization objectives. By carefully adjusting the cost factors for these two objectives, solutions were obtained with the optimal values of total vertical length. We have also implemented two other non-GA channel routers based on some straightforward heuristics. By comparing the solutions obtained by non-GA routers with those of GA-based router, results from the GA-based system were verified.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="0">
    <subfield code="a">Integrated circuits</subfield>
    <subfield code="x">Very large scale integration</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Yulu, Qi,</subfield>
    <subfield code="e">Chairperson</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Batanov, Dentcho N.,</subfield>
    <subfield code="e">Examination Committee</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Murai, Shunji,</subfield>
    <subfield code="e">Examination committee</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">The Government of Finland,</subfield>
    <subfield code="e">Scholarship donor</subfield>
  </datafield>
  <datafield tag="810" ind1="2" ind2=" ">
    <subfield code="a">Asian Institute of Technology.</subfield>
    <subfield code="t">Thesis ;</subfield>
    <subfield code="v">no. CS-95-9</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="3">Full-Text</subfield>
    <subfield code="u">http://203.159.5.9/ait-thesis/detail.php?q=B14993</subfield>
  </datafield>
  <datafield tag="907" ind1=" " ind2=" ">
    <subfield code="a">.b11494463</subfield>
    <subfield code="b">mnait</subfield>
    <subfield code="c">v</subfield>
  </datafield>
  <datafield tag="902" ind1=" " ind2=" ">
    <subfield code="a">240404</subfield>
  </datafield>
  <datafield tag="998" ind1=" " ind2=" ">
    <subfield code="b">0</subfield>
    <subfield code="c">960624</subfield>
    <subfield code="d">m</subfield>
    <subfield code="e">a  </subfield>
    <subfield code="f">v</subfield>
    <subfield code="g">0</subfield>
  </datafield>
  <datafield tag="945" ind1=" " ind2=" ">
    <subfield code="l">mnait</subfield>
  </datafield>
  <datafield tag="945" ind1=" " ind2=" ">
    <subfield code="l">mnarc</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">22</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">40</subfield>
  </datafield>
  <datafield tag="909" ind1=" " ind2=" ">
    <subfield code="a">Barcode : 30050120675821</subfield>
    <subfield code="b">CREATED : 2014-02-19</subfield>
    <subfield code="c">RECORD # : i12767323</subfield>
    <subfield code="d">LPATRON : 0</subfield>
    <subfield code="e">LCHKIN : -</subfield>
    <subfield code="f"># RENEWALS : 0</subfield>
    <subfield code="g"># OVERDUE : 0</subfield>
    <subfield code="h">IUSE3 : 0</subfield>
    <subfield code="i">TOT CHKOUT : 0</subfield>
    <subfield code="j">TOT RENEW : 0</subfield>
  </datafield>
  <datafield tag="909" ind1=" " ind2=" ">
    <subfield code="a">Barcode : 30050120356323</subfield>
    <subfield code="b">CREATED : 2016-06-14</subfield>
    <subfield code="c">RECORD # : i13035873</subfield>
    <subfield code="d">LPATRON : 0</subfield>
    <subfield code="e">LCHKIN : -</subfield>
    <subfield code="f"># RENEWALS : 0</subfield>
    <subfield code="g"># OVERDUE : 0</subfield>
    <subfield code="h">IUSE3 : 0</subfield>
    <subfield code="i">TOT CHKOUT : 0</subfield>
    <subfield code="j">TOT RENEW : 0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">6604</subfield>
    <subfield code="d">6604</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">mnait</subfield>
    <subfield code="d">2026-08-17</subfield>
    <subfield code="g">50.00</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">AIT Thesis no.CS-95-09</subfield>
    <subfield code="p">30050120675821</subfield>
    <subfield code="r">2026-08-17 16:28:59</subfield>
    <subfield code="t">3</subfield>
    <subfield code="w">2026-08-17</subfield>
    <subfield code="y">22</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">mnarc</subfield>
    <subfield code="d">2026-08-17</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">AIT Thesis no.CS-95-09</subfield>
    <subfield code="p">30050120356323</subfield>
    <subfield code="r">2026-08-17 16:28:59</subfield>
    <subfield code="w">2026-08-17</subfield>
    <subfield code="y">40</subfield>
  </datafield>
</record>
