Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Parallel Genetic Algorithms with Schema Migration
COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Hi-index | 0.00 |
Through analyzing schema theorem and building blocks theory, propose parallel genetic algorithms based on building blocks migration. Relying on convergence condition, receive building blocks from other populations. Using simulated annealing method prevent the density of good schema to increase greatly which will result in premature convergence. Theory analysis and experimental results show that the method not only reduce ineffective migration and decrease communication costs, but also lower the possibility of occurring premature and assure the capability of global convergence.