<?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>Ant colony search algorithm for unit commitment</title>
  </titleInfo>
  <name type="personal">
    <namePart>Thanathip Sum-im</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Weerakorn Ongsakul</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Surapong Chiraratananon</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Shrestha, Ram M.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>2002</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>45 leaves</extent>
  </physicalDescription>
  <abstract>In this research study, Ant Colony Search Algorithm (ACSA) is proposed to solve thermal unit commitment problem. ACSA is a new co-operative agent approach, which is derived from the theoretical biology on the topic of ant trail formation and foraging methods. In the ACSA, a set of co-operating agents called "ants" co-operates to find good solution to unit commitment problem of thermal units. The merits of ACSA are parallel search and optimization capabilities. In this study, the problem is decomposed in two subproblems. The unit commitment sub-problem is solved by the ant colony search algorithm method and the economic dispatch sub-problem is solved by the lambda-iteration method. The total production cost of the proposed method is cheaper than those of Dynamic Programming (DP), Lagrange Relaxation (LR) and Genetic Algorithm (GA) on the ten generating units system.</abstract>
  <note>A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Environment, Resources and Development</note>
  <subject authority="lcsh">
    <topic>Units</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Algorithms</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Research studies project report ; no. ET-02-10</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=B07266</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B07266</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">030808</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817162742.0</recordChangeDate>
  </recordInfo>
</mods>
