000			02007nam a2200253 a 4500
001			vtls000068059
003			KUKTEM
005			20251114204524.0
008			130109t2012 my da f m 000 0 eng d
020			_aTHE0001732(Local)
039		9	_a201905131214 _byusri _y201301091026 _zFida
040			_aUMP
090			_aQA76.63 .C43 2012 rs Bc.
100	1		_aChan, Chui Teng
245	1	0	_aSimulation of identifying shortest path walkway in library by using ant colony optimization / _cChan Chui Teng
260			_aKuantan, Pahang : _bUMP, _c2012
300			_axi, 66 p. : _bill. (some col.) ; _c30 cm. + _e1 CD-ROM
502			_aProject paper (Bachelor of Computer Science (Graphics & Multimedia Technology)) -- Universiti Malaysia Pahang - 2012
504			_aBibliography : p. 63-64
520	3		_aA 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.
650		0	_aLogic programming
650		0	_aSwarm intelligence
999			_aVIRTUA40 _c3486 _d3492
999			_aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992