STRATEGY KOMBINASI UNTUK MENYELESAIKAN QUADRATIC ASSIGNMENT PROBLEM
| Main Author: | Ahyaningsih, Faiz |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2016
|
| Subjects: | |
| Online Access: |
http://digilib.unimed.ac.id/41468/1/Fulltext.pdf http://digilib.unimed.ac.id/41468/2/Reviewer.pdf http://digilib.unimed.ac.id/41468/ http://seminar.uny.ac.id/semnasmatematika/sites/seminar.uny.ac.id.semnasmatematika/files/T-1.pdf |
Daftar Isi:
- The quadratic assignment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of flow between facilities, and distance between location. Due to the non-convexity nature of the problem, therefore to get a ‘good’ starting point is necessary in order to obtain a better optimal solution. In this paper we propose a random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get ‘optimal’ solution. We also create a comparative program to test the solution. As a computational experience we solve the problem of Had12 from QAPLIB, with the optimal solution = 1652, permutation = 3 10 11 2 12 5 6 7 8 1 4 9 , running time = 122.512347 second = 2.04 minute. The optimal solution reached in 1050 iterations.