Program Masalah Penugasan Kuadrat dengan Matriks Jarak dan Matriks Biaya Ordo 12x12

Abstract

The quadratic assignment prob-lem (QAP) is a problem about perrnutation as well as the problem of deciding optimal solution of objective function referred in multiplication of matrix activity 1 cost matrix ) with th! matrix location (distance matix), the size of matrix is n f n. For malil multiplication as much as n factorial ( n ! ). The program olafr gluea nduramtbice ra sosring,n miimenit tparkoebnl eims l oonng ceor stto m fiantisrihx and distance matrix with using the characteristic of symietric matrix will heft reducf time of deciding the optimal solution of the objective function.