Setiawan, Budhi (2007) PERBANDINGAN DAN IMPLEMENTASI ALGORITMA SEMT DAN ALGORTIMA HUNGARIAN UNUTK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM (QAP). Diploma thesis, Universitas Komputer Indonesia.
Full text not available from this repository.Abstract
Minimum cost search is a problem that always seen in production. This minimum cost search has connection with scheduling problem. With good scheduling so that would result an assignment which resulting small cost. There are two algorithms that can be useful for solving this assignment problem. There is Ant Colony Algorithm and Hungarian Algorithm that represented probabilistic model and deterministic model. For Ant Colony Algorithm, the minimum cost searching system was adapted from ant life activities to find their food. And Hungarian Algorithm, the searching system was doing with using arithmetic process in matrix.
| Item Type: | Thesis (Diploma) |
|---|---|
| Subjects: | S1-Final Project > Fakultas Teknik Dan Ilmu Komputer > Teknik Informatika > 2007 |
| Divisions: | Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer Universitas Komputer Indonesia > Fakultas Teknik dan Ilmu Komputer > Teknik Informatika (S1) |
| Depositing User: | Admin Repository |
| Date Deposited: | 16 Nov 2016 07:46 |
| Last Modified: | 16 Nov 2016 07:46 |
| URI: | http://repository.unikom.ac.id/id/eprint/10461 |
Actions (login required)
 |
View Item |
