Paper:
Dynamically Adjusting Migration Rates for Multi-Population Genetic Algorithms
Tzung-Pei Hong*, Wen-Yang Lin*, Shu-Min Liu**,
and Jiann-Horng Lin**
*Dept. of Computer Sci. and Info. Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan
**Dept. of Information Management, I-Shou University, Kaohsiung 840, Taiwan
- [1] T. C. Belding, “The distributed genetic algorithm revisited,” in Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 114-121, 1995.
- [2] H. C. Braun, “On solving travelling salesman problems by genetic algorithms,” in Proceedings of the First Workshop on Parallel Problem Solving from Nature, pp. 129-133, 1991.
- [3] E. Cant’u-Paz, “A survey of parallel genetic algorithms,” Calculateurs Paralleles, Reseaux et Systems Repartis, Vol.10, No.2, pp. 141-171, 1998.
- [4] E. Cant’u-Paz, “Migration policies and takeover time in parallel genetic algorithms,” in Proceedings of Genetic and Evolutionary Computation Conference, 1999.
- [5] E. Cant’u-Paz and D. E. Goldberg, “Efficient parallel genetic algorithms: Theory and practice,” Computer Methods in Applied Mechanics and Engineering.
- [6] J. P. Cohoon, S. U. Hegde, W. N. Martin, and D. S. Richard, “Punctuated equilibria: A parallel genetic algorithm,” in Proceedings of the Second International Conference on Genetic Algorithms, pp. 148-154, 1987.
- [7] J. P. Cohoon, W. N. Martin, and D. S. Richards, “Punctuated equilibria: A parallel genetic algorithm,” in Proceedings of the Second International Conference on Genetic Algorithms, pp. 148-154, 1987.
- [8] J. J. Grefenstette, “Parallel adaptive algorithms for function optimization,” Technical Report No. CS-81-19, Vanderbilt University, Computer Science Department, Nashville, TN, 1981.
- [9] P. B. Grosso, “Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model,” Doctoral Dissertation, The University of Michigan, 1985.
- [10] S. C. Lin, W. F. Punch III, and E. D. Goodman, “Coarse-grain parallel genetic algorithms: categorization and new approach,” in Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 28-37, 1994.
- [11] S. Martello and P. Toth, “Knapsack Problems,” John Wiley, UK, 1990.
- [12] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1994.
- [13] H. Muhlenbein, M. Schomisch, and J. Born, “The parallel genetic algorithm as function optimizer,” in Proceedings of the Fourth International Conference on Genetic Algorithms, 1991.
- [14] M. Munetomo, Y. Takai, and Y. Sato, “An efficient migration scheme for subpopulation-based asynchronously parallel genetic algorithms,” in Proceedings of the Fifth International Conference on Genetic Algorithms, 1993.
- [15] C. B. Pettey, M. R. Leuze, and J. J. Grefenstette, “A parallel genetic algorithm,” in Proceedings of the Second International Conference on Genetic Algorithms, pp. 155-161, 1987.
- [16] D. Schlierkamp-Voosen and H. Muhlenbein, “Adaptation of population sizes by competing subpopulations,” in Proceedings of IEEE International Conference on Evolutionary Computation, pp. 330-335, 1996.
- [17] R. Tanese, “Parallel genetic algorithm for a hypercube,” in Proceedings of the Second International Conference on Genetic Algorithms, pp. 434-439, 1987.
- [18] R. Tanese, “Distributed genetic algorithms,” in Proceedings of the Third International Conference on Genetic Algorithms, pp. 177-183, 1989.
This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.