| Abstract: |  Firefly Algorithm (FA), introduced in 2008 by X. S. Yang, belongs with the nature-inspired algorithms. It is a meta-heuristic, based on the firefly bugs’ behaviour, including the light emission, light absorption and the mutual attraction, which was developed to solve the continuous optimization problems. This thesis describes Firefly Algorithm and proposes a possible way it can be adjusted to solve the class of discrete problems Quadratic Assignment Problem (QAP), where the solutions consist of the permutation of the integers. Explained is the Firefly Algorithm’s
discretization, which consists of constructing a suitable conversion of the continuous functions as are attractiveness, distance and movement, into new discrete functions. New Discrete Firefly Algorithm (DFA) is implemented into the framework SEAGE, where the DFA is examined and
experimentally tested on 11 different QAP problems chosen from the public QAPLIB Library. Results of these experiments are analysed and described in this work.
|
|---|