A new genetic representation for quadratic assignment problem

Authors

  • Jozef Kratica Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade
  • Dušan Tošić Faculty of Mathematics, Belgrade
  • Vladimir Filipović Faculty of Mathematics, Belgrade
  • Đorđe Dugošija Faculty of Mathematics, Belgrade

DOI:

https://doi.org/10.2298/YJOR1102225K

Keywords:

Genetic algorithm, evolutionary computation, combinatorial optimization, quadratic assignment problem

Abstract

In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP). The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets known from the literature. The presented results show that in all cases proposed genetic algorithm reached known optimal solutions in reasonable time.

Downloads

Published

2011-09-01

Issue

Vol. 21 No. 2 (2011)

Section

Research Articles

License

Copyright (c) YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.