Menyelesaikan Quadratic Assignment Problem dengan Metode Heuristik Kelayakan

Abstract

The Quadratic assignment problem (QAP) 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 interns of distance between locations and flows between facilities. 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 a starting point, and then we use forward and backward exchange strategy to get the optimal solution. As a computational experience we solved 42 x 42 backboard wiring problem.