A COMBINED STRATEGY FOR SOLVING QUADRATIC ASSIGNMENT PROBLEM
| Main Author: | Ahyaningsih, Faiz |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2017
|
| Subjects: | |
| Online Access: |
http://digilib.unimed.ac.id/41469/1/Fulltext.pdf http://digilib.unimed.ac.id/41469/2/Reviewer.pdf http://digilib.unimed.ac.id/41469/3/Turnitin.pdf http://digilib.unimed.ac.id/41469/ https://doi.org/10.1063/1.4994409 |
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 combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get ‘optimal’ solution). As a computational experience we’ve solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data –Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.