Analisis Komparasi Genetic Algorithm dan Firefly Algorithm pada Permasalahan Quadratic-Assignment-Problem (QAP)

Main Article Content

Desi Novianti
Dewi Anjani


Quadratic Assignment Problem (QAP) is the problem of determining the location of several facilities to a certain number of places to minimize the cost of moving. This displacement considers the flow of material or people movement and the distance between locations. Many studies have developed several efficient methods for solving QAP, one of which is metaheuristics. In this paper, the metaheuristic methods used are Genetic Algorithm (GA) and Firefly Algorithm (FA). The data used is taken from the Nugent data on QAPLIB with 12x12, 16x16, 20x20, and 30x30 matrices. This study proves that FA is an algorithm that produces the most optimal results with indicators in the test getting the best results (12x12 and 16x16), having better average and deviation values and faster computational time than GA. Meanwhile, for comparing the results obtained by the Nugent, FA also has more optimal results on the 12x12 and 16x16 matrices. However, the 20x20 and 30x30 GA metrics get more optimal results.

Article Details

Art Jan


R. K. Bhati and A. Rasool, “Quadratic Assignment Problem and its Relevance to the Real World: A Survey,” International Journal of Computer Applications, vol. 96, no. 9, pp. 42–47, 2014, doi: 10.5120/16825-6584.

R. E. Burkard and E. Qela, The quadratic assignment problem: Handbook of combinatorial optimization, vol. 3. Kluwer Academic Publishers, 1998. doi: 10.1287/mnsc.9.4.586.

H. D. Purnomo, Cara Mudah Belajar Metode Optimisasi Metaheuristik Menggunakan Matlab. Yogyakarta: Gava Media, 2014.

R. E. Burkard, S. E. E. Çela, Karisch, and F. Rendl, “QAPLIB - A Quadratic Assignment Problem Library: Problem Instances and Solutions,” Eranda Çela, 2002.

H. Kılıç and U. Yüzgeç, “Improved Antlion Optimization Algorithm for Quadratic Assignment Problem,” Malaysian Journal of Computer Science, vol. 34, no. 1, pp. 34–60, 2021, doi: 10.22452/mjcs.vol34no1.3.