Tackling the quadratic assignment problem by local optima

Authors

  • Yurii Mykhailovych Zorin National Technical University of Ukraine "KPI"
  • Serhii Valentynovych Podolskyi EPAM Systems,

Keywords:

quadratic assignment problem, heuristic algorithm, combinatorial optimization, local minimum

Abstract

The paper presents a new heuristic algorithm for the quadratic assignment problem. Unlike existing heuristic algorithms that require a few input parameters setting, the proposed algorithm uses only one parameter and is based on the idea of exploiting a combination of different local optima in the neighborhood of the two elements permutations. At the same time it allows to obtain solutions of better quality in slightly lesser time compared to the known algorithms.

Author Biographies

Yurii Mykhailovych Zorin, National Technical University of Ukraine "KPI"

 
Associate Professor Department. SPiSKS, Department of Applied Mathematics

Serhii Valentynovych Podolskyi, EPAM Systems,

Software Engineer

Downloads

Abstract views: 255

How to Cite

[1]
Y. M. Zorin and S. V. Podolskyi, “Tackling the quadratic assignment problem by local optima”, ІТКІ, vol. 28, no. 3, Jun. 2014.

Issue

Section

Mathematical modeling and computational methods

Metrics

Downloads

Download data is not yet available.