Article ID Journal Published Year Pages File Type
10524008 Operations Research Letters 2005 6 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Compounded genetic algorithms for the quadratic assignment problem
Authors
,