Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Authors:
Alfonsas Misevičius;Dalius Rubliauskas
Affiliations:
Department of Multimedia Engineering, Kaunas University of Technology, Studentų 50-400a/416a, LT-51368 Kaunas, Lithuania, e-mail: alfonsas.misevicius@ktu.lt;Department of Multimedia Engineering, Kaunas University of Technology, Studentų 50-401, LT-51368 Kaunas, Lithuania, e-mail: dalius@soften.ktu.lt
Venue:
Informatica
Year:
2009

Citing 13
Cited 4

A genetic approach to the quadratic assignment problem

Computers and Operations Research - Special issue on genetic algorithms
P-Complete Approximation Problems

Journal of the ACM (JACM)
Efficient Genetic Algorithms Using Simple Genes Exchange LocalSearch Policy for the Quadratic Assignment Problem

Computational Optimization and Applications
A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory

Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
FANT: Fast ant system

FANT: Fast ant system
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
A New Genetic Algorithm for the Quadratic Assignment Problem

INFORMS Journal on Computing
A tabu search algorithm for the quadratic assignment problem

Computational Optimization and Applications
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Compounded genetic algorithms for the quadratic assignment problem

Operations Research Letters

Optimization and Knowledge-Based Technologies

Informatica
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems

Informatica
Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem

Information Sciences: an International Journal
Enhancing the performance of hybrid genetic algorithms by differential improvement

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an efficient hybrid genetic algorithm (HGA) and its variants for the well-known combinatorial optimization problem, the quadratic assignment problem (QAP) are discussed. In particular, we tested our algorithms on a special type of QAPs, the structured quadratic assignment problems. The results from the computational experiments on this class of problems demonstrate that HGAs allow to achieve near-optimal and (pseudo-)optimal solutions at very reasonable computation times. The obtained results also confirm that the hybrid genetic algorithms are among the most suitable heuristic approaches for this type of QAPs.