| Article ID: | iaor2006338 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 5 |
| Start Page Number: | 475 |
| End Page Number: | 480 |
| Publication Date: | Sep 2005 |
| Journal: | Operations Research Letters |
| Authors: | Drezner Zvi |
| Keywords: | genetic algorithms, quadratic assignment |
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.