Parallel Genetic Algorithms with Local SearchReport
This paper presents methods of applying local search to global optimization problems. The most common approach, multistart, selects the best solution from restarts of local search from random starting points. Partitional methods augment local search with general principles concerning the location of global optima in real space, significantly improving the effectiveness of local search in function optimization problems. Standard partitional methods, however, are not directly applicable to combinatorial optimization problems. We describe a genetic algorithm, GALO, that is similar to the partitional methods, but can be applied to combinatorial problems. Empirical results are presented for a parallel implementation of GALO that show it to be effective for the quadratic assignment problem.
Note: Abstract extracted from PDF file via OCR
All rights reserved (no additional license for public reuse)
Huntley, CL, and DE Brown. "Parallel Genetic Algorithms with Local Search." University of Virginia Institute for Parallel Computation Tech Report (1990).
University of Virginia, Institute for Parallel Computation