Journal
PARALLEL COMPUTING
Volume 31, Issue 8-9, Pages 839-857Publisher
ELSEVIER
DOI: 10.1016/j.parco.2005.03.006
Keywords
genetic algorithm; simulated annealing; parallel genetic algorithm
Categories
Ask authors/readers for more resources
This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into sub-populations, and in each sub-population the algorithm uses the local search ability of simulated annealing after crossover and mutation. The best individuals of each subpopulation are migrated to neighboring ones after a certain number of epochs. An implementation of the algorithm is discussed and the performance is evaluated against a standard set of test functions. PGSA shows some remarkable improvement in comparison with the conventional parallel genetic algorithm and the breeder genetic algorithm (BGA). (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available