Abstract | ||
---|---|---|
We propose to take advantage of symmetry that exists in some quadratic assignment instances when employing genetic or hybrid genetic algorithms to solve such instances. Such symmetry usually exists when the potential sites for the facilities are arranged in a rectangle. We designed a simple and effective approach to identify equivalent solutions if such symmetry exists. We propose three variants of this modification. Extensive computational experiments (performing 21,000 runs on instances with up to 150 facilities) show that the modified approach performed significantly better without increasing the running times. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1080/03155986.2019.1607809 | INFOR |
Keywords | DocType | Volume |
Genetic algorithms, hybrid genetic algorithms, quadratic assignment problem | Journal | 57 |
Issue | ISSN | Citations |
4 | 0315-5986 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zvi Drezner | 1 | 1195 | 140.69 |