A robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem

2013-07-01
Tosun, Umut
Dokeroglu, Tansel
Coşar, Ahmet
The Quadratic Assignment Problem (QAP) is a difficult and important problem studied in the domain of combinatorial optimisation. It is possible to solve QAP instances with 10--20 facilities using exhaustive parallel algorithms within a few days on a cluster machine. However, large QAP instances with more than 100 facilities are not solvable using exhaustive techniques. We have explored a variety of Genetic Algorithm crossover operators for this problem and verified its performance experimentally using well-known instances from the QAPLIB library. By increasing the number of processors, generations and population sizes we have been able to find solutions that are the same as (or very close to) the best reported solutions for large QAP instances in QAPLIB. In order to parallelise the Genetic Algorithm we generate and evolve separate solution pools on each cluster processor, using an island model. This model exchanges 10% of each processor's solutions at the initial stages of optimisation. We show experimentally that both execution times and solution qualities are improved for large QAP instances by using our Island Parallel Genetic Algorithm.
Citation Formats
U. Tosun, T. Dokeroglu, and A. Coşar, “A robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem,” pp. 4117–4133, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31259.