| 000 | 02037nam a2200253 a 4500 | ||
|---|---|---|---|
| 001 | vtls000068026 | ||
| 003 | KUKTEM | ||
| 005 | 20251114204533.0 | ||
| 008 | 130107t2012 my da f m 000 0 eng d | ||
| 020 | _aTHE0001736(Local) | ||
| 039 | 9 |
_a201905131216 _byusri _y201301071444 _zFida |
|
| 040 | _aUMP | ||
| 090 | _aQA76.63 .Y66 2012 rs Bc. | ||
| 100 | 1 | _aYong, Kae Shin | |
| 245 | 1 | 0 |
_aSimulation of identifying shortest path walkway using particle swarm optimization (PSO) / _cYong Kae Shin |
| 260 |
_aKuantan, Pahang : _bUMP, _c2012 |
||
| 300 |
_axi, 52 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. 52 | ||
| 520 | 3 | _aThe purpose of this research is to present the development of the system of Simulation of Identifying Shortest Path Walkway using Particle Swarm Optimization (PSO). This application system is use to solve the shortest path problem in the simulated environment. The suggested simulation environment is a restaurant. In the real world restaurant, if the waiter unable to deliver the food within short period of time, this may reduce the customer satisfaction and downgrade the work performance. This will not only happen in the restaurant, since people nowadays prefer the effective services. Therefore, this project is develop to find the shortest path which means to find a path with minimum distance between two locations by apply the algorithm of Particle Swarm Optimization technique. This system is expected to solve the shortest path and identify the optimal path. Due to this, it is tend to reduce the time consume in specific situation with the determining of shortest path. The development of this system could bring convenience and effectiveness for the work in progress. | |
| 650 | 0 | _aLogic programming | |
| 650 | 0 | _aSwarm intelligence | |
| 999 |
_aVIRTUA40 _c3744 _d3750 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992 | ||