Compounded genetic algorithms for the quadratic assignment problem

Authors:
Zvi Drezner
Affiliations:
Department of ISDS, College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834-6848, USA
Venue:
Operations Research Letters
Year:
2005

Citing 2
Cited 2

A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
A New Genetic Algorithm for the Quadratic Assignment Problem

INFORMS Journal on Computing

Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem

Computers and Operations Research
Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the compounded genetic algorithm. We propose to run a quick genetic algorithm several times as Phase 1, and compile the best solutions in each run to create a starting population for Phase 2. This new approach was tested on the quadratic assignment problem with very good results.