Abstract
This paper introduces the primary research involving Self Organinsing Migrating Algorithm (SOMA) to the permutative problem of Quadratic Assignment. SOMA is transformed from its canonical form to successfully solve permutative 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.
Keywords
Cite this article
@article{cai-18169,
author = {Donald Davendra and Ivan Zelinka},
title = {Optimization of Quadratic Assignment Problem Using Self Organising Migrating Algorithm},
journal = {Computing and Informatics},
volume = {28},
number = {2},
pages = {169--180},
year = {2009},
issn = {1335-9150},
url = {https://cai.type.sk/content/2009/2/optimization-of-quadratic-assignment-problem-using-self-organising-migrating-algorithm/}
}
TY - JOUR AU - Donald Davendra AU - Ivan Zelinka TI - Optimization of Quadratic Assignment Problem Using Self Organising Migrating Algorithm JO - Computing and Informatics VL - 28 IS - 2 SP - 169 EP - 180 PY - 2009 SN - 1335-9150 UR - https://cai.type.sk/content/2009/2/optimization-of-quadratic-assignment-problem-using-self-organising-migrating-algorithm/ KW - Self organizing migrating algorithm KW - quadratic assignment problem KW - combinatorial optimization ER -
Davendra, D., & Zelinka, I. (2009). Optimization of Quadratic Assignment Problem Using Self Organising Migrating Algorithm. Computing and Informatics, 28(2), 169–180. https://cai.type.sk/content/2009/2/optimization-of-quadratic-assignment-problem-using-self-organising-migrating-algorithm/