Title A new hybrid genetic algorithm for the grey pattern quadratic assignment problem
Authors Misevičius, Alfonsas ; Stanevičienė, Evelina
DOI 10.5755/j01.itc.47.3.20728
Full Text Download
Is Part of Information technology and control = Informacinės technologijos ir valdymas.. Kaunas : KTU. 2018, vol. 47, no. 3, p. 503-520.. ISSN 1392-124X. eISSN 2335-884X
Keywords [eng] computational intelligence ; heuristics ; hybrid genetic algorithms ; tabu search ; combinatorial optimization ; grey pattern quadratic assignment problem
Abstract [eng] In this paper, we propose an improved hybrid genetic algorithm for the solution of the grey pattern quadratic assignment problem (GP-QAP). The novelty is the hybridization of the genetic algorithm with the so-called hierarchical iterated tabu search algorithm. Very fast exploration of the neighbouring solutions within the tabu search algorithm is used. In addition, a smart combination of the tabu search and adaptive perturbation is adopted, which enables a good balance between diversification and intensification during the iterative optimization process. The results from the experiments with the GP-QAP instances show that our algorithm is superior to other heuristic algorithms. Many best known solutions have been discovered for the large-scaled GP-QAP instances.
Published Kaunas : KTU
Type Journal article
Language English
Publication date 2018
CC license CC license description