Octariani, Octariani and Antoni, Darius and Emigawaty, Emigawaty (2008) ALGORITMA SEMUT UNTUK PENYELESAIAN TRAVELLING SALESMAN PROBLEM. jurnal matriks, 10 (2). ISSN 1411-1624
|
Text
Algoritma Semut Untuk Penyelesaian Traveling Salesman Problem.pdf Download (453kB) | Preview |
Abstract
Abstract: The growth of computer science has been applied in problem solving to make easy human work. One of them is in scheduling work and to determine the route of salesman transportation. The activity of salesman transportation is solved heavy problem to determine which route will be passed or before hand passed and has been passed. Often times salesman is consusing to start there transportation. To solve that problem, writer want make ant algorithm applying system to solve the travelling salesman problem with microsoft visual basic 6.0 to solved salesman transportation problem which is developed by waterfall model method. Keyword: Ant Algorithm, Stigmery, Travelling Salesman Problem
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Jurnal Ilmiah Terpadu Universitas Bina Darma |
| Date Deposited: | 29 Jun 2015 04:05 |
| Last Modified: | 29 Jun 2015 04:05 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/2303 |
Actions (login required)
 |
View Item |
