Parallel Genetic Algorithms with Local Search

CL Huntley & DE Brown
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,...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.