Flower Pollination Algorithm (FPA) to Solve Quadratic Assignment Problem (QAP)
Downloads
The purpose of this paper is to solve Quadratic Assignment Problem using Flower Pollination Algorithm. Quadratic Assignment Problem discuss about assignment of facilities to locations in order to minimize the total assignment costs where each facility assigns only to one location and each location is assigned by only one facility. Flower pollination Algorithm is an algorithm inspired by the process of flower pollination. There are two main steps in this algorithm, global pollination and local pollination controlled by switch probability. The program was created using Java programming language and implemented into three cases based on its size: small, medium and large. The computation process obtained the objective function value for each data using various values of parameter. According to the pattern of the computational result, it can be concluded that a high value of maximum iteration of the algorithm can help to gain better solution for this problem.
Kartasapoetra. G, 2000, Pembentukan Perusahaan Industri, Jakarta, Grafindo Persada.
Singh, S., Dubey, G.C., and Shrivasta, R., 2012, A comperative analysis of assignment problem, Journal of Engineering, Vol. 2, pp 2250-3021.
Taha, H.A., 1996, Riset Operasi Suatu Pengantar, Penerjemah : Daniel Wirajaya, Jilid I (5nd ed.) Jakarta: Binarupa Aksara.
Herjanto. Eddy, 2008, Manajemen Operasi Edisi Ketiga, Jakarta, Grasindo.
Tate and Smith A. E., 1992, A Genetic Approach to The Quadratic Assignment Problem, Computer and Operation Research Vol. 22, pp 73-83.
Erdogan, G. dan Tansel, B. C., 2011, Two Classes of Quadratic Assignment Problem That are Solvable as Linear Assignment Problem, International Jurnal for Research in Science and Advanced Technologies, Pages 446-451.
Tate and Smith A. E., 1992, A Genetic Approach to The Quadratic Assignment Problem, Computer and Operation Research Vol. 22, pp 73-83.
Burkard, R. E., and Rendl, F., 1984, A thermodynamically motivated simulation procedure for combinatorial optimization problems, European Journal of Operational Research. Vol. 17 issue 2, pp 169-174.
Chakrapani, J., and Skorin-Kapov, J., 1993, Massively Parallel Tabu Search for The Quadratic Assignment Problem, Annals of Operation Research, Vol. 41, pp 327 -341.
Gambardella, L. M., Taillard, E., Agazzi, G., 1998, MACS-QAP: A Multiple Ant Colony System for Quadratic Assignment Problem, Lugano Switzerland.
X.-S. Yang, 2012, Flower Pollination Algorithm for Global Optimization, in: International Conference and Natural Computation, Vol. 7445, pp 240-249.
Gass, S. L., and Harris, C. M., 1989, Encylopedia of Operations Research and Management Science, Boston : Kluwer Academic Publishers.
Gen, M., and Cheng, R., 1997, Genetic Algorithms and Engineering Design, New York: John Willey and Sons.
Knuth, D.E., 1997, The Art of Computer Programming, Fundamental Algorithm Canada.
Diethelm, K., 2004, The Analysis of Fractional Differential Equation, Springer, New York.
Dorigo, M., Manniezzo, V., and Colorni, A., 1996, The Ant System Optimization by a Colony of Cooperating Agent, IEEE Transaction on system, Man, And Cybernetic-Part B Vol. 26, pp 29-41.
Hadley, S.W., Rendl, F., and Wolkowiez, H., 1992, http://anjos.mgi.polymtl.ca/qaplib//inst.html , 20 Desember 2018.
Krarup, J., and Pruzan, P. M., 1978, http://anjos.mgi.polymtl.ca/qaplib//inst.html , 20 Desember 2018.
Civicioglu, P., Besdok, E., 2013, Comparative Analysis of the Cuckoo Search Algorithm, In: Yang XS.(eds) Cuckoo Search and Firefly Algorithm. Studies in Computational Intelligence, Vol 516, pp 85-113.
Kaveh , A., dan Bakhspoori, T., 2013, Optimum Design of Steel Frames Using Cuckoo Search Algorithm with Levy Flights, Struct Des Tall Spec Build 22 (13) . 1023-1036.
