Top > JACIII > Dynamically Adjusting Migration Rates for Multi-Population Gen ...

single-jc.php

JACIII Vol.11 No.4 pp. 410-415
doi: 10.20965/jaciii.2007.p0410
(2007)

Paper:

Views over last 60 days: 466

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

Received:
May 25, 2006
Accepted:
August 11, 2006
Published:
April 20, 2007
Creative Commons License
Keywords:
soft computing, genetic algorithms, multi-population, migration interval, migration rate
Abstract
In this paper, the issue of adapting migration parameters for MGAs is investigated. We examine, in particular, the effect of adapting the migration rates on the performance and solution quality of MGAs. Thereby, we propose an adaptive scheme to adjust the appropriate migration rates for MGAs. If the individuals from a neighboring sub-population can greatly improve the solution quality of a current population, then the migration from the neighbor has a positive effect. In this case, the migration rate from the neighbor should be increased; otherwise, it should be decreased. According to the principle, an adaptive multi-population genetic algorithm which can adjust the migration rates is proposed. Experiments on the 0/1 knapsack problem are conducted to show the effectiveness of our approach. The results of our work have illustrated the effectiveness of self-adaptation for MGAs and paved the way for this unexplored area.
Cite this article as:
T. Hong, W. Lin, S. Liu, and J. Lin, “Dynamically Adjusting Migration Rates for Multi-Population Genetic Algorithms,” J. Adv. Comput. Intell. Intell. Inform., Vol.11 No.4, pp. 410-415, 2007.
Data files:
References
  1. [1] T. C. Belding, “The distributed genetic algorithm revisited,” in Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 114-121, 1995.
  2. [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. [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. [4] E. Cant’u-Paz, “Migration policies and takeover time in parallel genetic algorithms,” in Proceedings of Genetic and Evolutionary Computation Conference, 1999.
  5. [5] E. Cant’u-Paz and D. E. Goldberg, “Efficient parallel genetic algorithms: Theory and practice,” Computer Methods in Applied Mechanics and Engineering.
  6. [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. [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. [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. [9] P. B. Grosso, “Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model,” Doctoral Dissertation, The University of Michigan, 1985.
  10. [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. [11] S. Martello and P. Toth, “Knapsack Problems,” John Wiley, UK, 1990.
  12. [12] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1994.
  13. [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. [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. [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. [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. [17] R. Tanese, “Parallel genetic algorithm for a hypercube,” in Proceedings of the Second International Conference on Genetic Algorithms, pp. 434-439, 1987.
  18. [18] R. Tanese, “Distributed genetic algorithms,” in Proceedings of the Third International Conference on Genetic Algorithms, pp. 177-183, 1989.

Creative Commons License  This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 22, 2024