<?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>02007nam a2200253 a 4500</leader>
  <controlfield tag="001">vtls000068059</controlfield>
  <controlfield tag="003">KUKTEM</controlfield>
  <controlfield tag="005">20251114204524.0</controlfield>
  <controlfield tag="008">130109t2012    my da  f m    000 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">THE0001732(Local)</subfield>
  </datafield>
  <datafield tag="039" ind1=" " ind2="9">
    <subfield code="a">201905131214</subfield>
    <subfield code="b">yusri</subfield>
    <subfield code="y">201301091026</subfield>
    <subfield code="z">Fida</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">UMP</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="a">QA76.63 .C43 2012 rs Bc.</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Chan, Chui Teng</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Simulation of identifying shortest path walkway in library by using ant colony optimization /</subfield>
    <subfield code="c">Chan Chui Teng</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Kuantan, Pahang :</subfield>
    <subfield code="b">UMP,</subfield>
    <subfield code="c">2012</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xi, 66 p. :</subfield>
    <subfield code="b">ill. (some col.) ;</subfield>
    <subfield code="c">30 cm. +</subfield>
    <subfield code="e">1 CD-ROM</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
    <subfield code="a">Project paper (Bachelor of Computer Science (Graphics &amp; Multimedia Technology)) -- Universiti Malaysia Pahang - 2012</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Bibliography : p. 63-64</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Logic programming</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Swarm intelligence</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">1</subfield>
    <subfield code="a">20000</subfield>
    <subfield code="b">20000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">QA76.63 .C43 2012 rs Bc.</subfield>
    <subfield code="p">0000068751</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">PSM</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">1</subfield>
    <subfield code="a">10000</subfield>
    <subfield code="b">10000</subfield>
    <subfield code="d">2019-09-04</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CD 6557 | QA76.63 .C43 2012 rs Bc.</subfield>
    <subfield code="p">0000068752</subfield>
    <subfield code="r">2019-09-04 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2019-09-04</subfield>
    <subfield code="y">PSM</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VIRTUA40</subfield>
    <subfield code="c">3486</subfield>
    <subfield code="d">3492</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="a">VTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992</subfield>
  </datafield>
</record>
