<?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>Simulation of identifying shortest path walkway in library by using ant colony optimization</title>
  </titleInfo>
  <name type="personal">
    <namePart>Chan, Chui Teng</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">theses</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">my</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Kuantan, Pahang</placeTerm>
    </place>
    <publisher>UMP</publisher>
    <dateIssued>2012</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xi, 66 p. : ill. (some col.) ; 30 cm. + 1 CD-ROM</extent>
  </physicalDescription>
  <abstract>A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library. This is a research that the algorithm is aim to implement on a robot. The robot is used to walk around in the library to collect books from all the tables and put on book shelves. However, command prompt window will use to shows the result which is the shortest path. People nowadays are more concern about the efficiency of work, this may happen in library as well. Therefore, by determining the shortest path will help in reducing the time consume problem. This project is developed by starting with designing the workflow diagram as well as the design of the output interface. The work flow is the guide for the process of development. In between, Heuristic Approach is used to determine the entire possible paths at first, then Ant Colony Optimization algorithm will be implemented to search for the final and the shortest path. The system is used to be error free and the algorithm can effectively solve the shortest path problem.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Chan Chui Teng</note>
  <note>Project paper (Bachelor of Computer Science (Graphics &amp; Multimedia Technology)) -- Universiti Malaysia Pahang - 2012</note>
  <note>Bibliography : p. 63-64</note>
  <subject authority="lcsh">
    <topic>Logic programming</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Swarm intelligence</topic>
  </subject>
  <identifier type="isbn">THE0001732(Local)</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">130109</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251114204524.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000068059</recordIdentifier>
  </recordInfo>
</mods>
