Optimization of quadratic assignment problem using self organising migrating algorithm

Abstract

Přístupu dynamice a shlukování pro permutativní problémy je uveden v této publikaci. Algoritmus SOMA je upraven pomocí tohoto přístupu a prověřena na QAPproblému. Výsledky jsou podložené rozsáhlými experimenty.

This paper introduces the primary research involving Self Organinsing Migrating Algorithm (SOMA) to the permutative problem of Quadratic Assign- ment. SOMA is transformed from its canonical form to successfully solve permuta- tive optimization problems. Conversion and repairment routines are added to the generic SOMA. The results presented outline the high effectiveness of SOMA for solving QAP problems.