Please use this identifier to cite or link to this item:
|Title:||Multi-niche crowding in the development of parallel simulated annealing|
|Authors:||Wang, Z.-G. |
Parallel genetic algorithm
|Citation:||Wang, Z.-G.,Rahman, M.,Wong, Y.-S. (2005). Multi-niche crowding in the development of parallel simulated annealing. GECCO 2005 - Genetic and Evolutionary Computation Conference : 1555-1556. ScholarBank@NUS Repository.|
|Abstract:||In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from the local optima. Then, the idea of hierarchical parallel G A is borrowed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population of parallel GSA. The performance of the proposed algorithms is evaluated against a standard set of multimodal benchmark functions. Multi-niche crowding PGSA and normal PGSA show some remarkable improvement in comparison with the conventional parallel GA and the breeder genetic algorithm.|
|Source Title:||GECCO 2005 - Genetic and Evolutionary Computation Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 26, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.