INVESTIGATING REPLACEMENT STRATEGIES FOR THE ADAPTIVE DISSORTATIVE MATING GENETIC ALGORITHM

Carlos M. Fernandes, Juan Julán Merelo, Agostinho C. Rosa

Abstract

This paper investigates the effects of modifying the Adaptive Dissortative Mating Genetic Algorithm (ADMGA) replacement strategy on the performance of the algorithm in dynamic problems. ADMGA is a variation of the standard GA with a mating restriction based on the genotypic similarity of the individuals. Dissimilar individuals mate more often than expected by chance and, as a result, genetic diversity throughout the run is maintained at a higher level. ADMGA was previously tested in dynamic optimization problems with promising results: the algorithm shows to outperform standard GAs and state-of-the-art approaches on several problems and dynamics. However, the performance of the algorithm degrades when the frequency of changes increases. Due to the premises under which ADMGA was tested, it has been argued that the replacement strategy that emerges from the algorithm’s dissortative mating strategy may be harming the performance in such situations. This study proposes alternative replacement schemes with the objective of improving ADMGA’s performance on fast changing environments (without damaging the performance on slower ones). The strategies maintain the simplicity of the algorithm, i.e., the parameter set is not increased. The replacement schemes were tested in dynamic environments based on stationary functions with different characteristics, showing to improve standard ADMGA’s performance in fast dynamic problems.

References

  1. Angeline, P., 1997. Tracking Extrema in Dynamic Environments. In Proc. of the 6th International Conf. on Evolutionary Programming, Springer, 335-345.
  2. Branke, J., 1999. Memory enhanced evolutionary algorithms for changing optimization problems. In Proc. of the 1999 IEEE Congress on Evolutionary Computation, IEEE Press, 1875-1882.
  3. Branke, J., Kaußler, T., Schmidt, C., Schmeck, H., 2000. A multi-population approach to dynamic optimization problems. In Proc. of the Adaptive Computing in Design and Manufacturing (ACDM'2000), I.C. Parmee, Ed., London, UK: Springer-Verlag, 299-308.
  4. Branke, J., 2001. Evolutionary optimization in dynamic environments. Norwel, MA: Kluwer.
  5. Cobb, H. G., 1990. An investigation into the use of hypermutation as an adaptive operator in GAs having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA.
  6. Eschelman, L. J., Schaffer, J. D., 1991. Preventing premature convergence in genetic algorithms by preventing incest. In Proc. of the 4th International Conference on Genetic Algorithms, Morgan Kauffman, San Francisco, 115-122.
  7. Fernandes, C. M., Rosa, A. C., 2001. A Study on NonRandom Mating in Evolutionary Algorithms Using a Royal Road Function. In Proc. of the 2001 Congress on Evolutionary Computation, IEEE Press, 60-66.
  8. Fernandes, C. M., Rosa, A. C., 2008. Self-adjusting the intensity of dissortative mating of genetic algorithms. Journal of Soft Computing, vol. 12, 955-979.
  9. Fernandes, C. M., Rosa, A. C., 2008. Evolutionary Algorithms with Dissortative Mating on Static and Dynamic Environments. Advances in Evolutionary Algorithms, W. Kosinski Ed., In-Tech, 181-206.
  10. Fernandes, C. M., Merelo, J. J., Ramos, V., Rosa, A. C., 2008. A Self-Organized Criticality Mutation Operator for Dynamic Optimization Problems. In Proc. of the 2008 Genetic and Evolutionary Computation Conference, ACM Press, pp. 937-944.
  11. Fernandes, C. M., 2009. Diversity-enhanced Genetic Algorithms for dynamic optimization. Ph.D Thesis, Tec. Univ. of Lisbon, (http://geneura.ugr.es/pub/ tesis/PhD-CFernandes.pdf)
  12. Goldberg, D. E., Smith, R. E., 1987. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In Proc. of the 2nd International Conference on Genetic Algorithms, New Jersey, 1987, 59-68.
  13. Grefenstette, J. J., 1992. Genetic algorithms for changing environments. In Parallel Problem Solving from Nature II, R. Manner and B. Manderick, Eds., NorthHolland, Amsterdam, 137-144.
  14. Ochoa, G., Madler-Kron, C., Rodriguez, R., Jaffe, K., 2005. Assortative mating in genetic algorithms for dynamic problems. In Proc. of the 2005 EvoWorkshops, LNCS 3449, Springer, pp. 617-622.
  15. Ochoa, G., 2006, Error Thresholds in Genetic Algorithms. Evolutionary Computation, 14(2), 157-182.
  16. Ramsey, C. L., Grefenstette, J. J., 1993. Case-based initialization of genetic algorithms. In Proc. of the 5th International Conference Genetic Algorithms, Morgan Kaufmann, 84-91.
  17. P. J. Russel, Genetics. Benjamin/Cummings, 1998.
  18. Thierens, D., 1999. Scalability problems of simple GAs. Evolutionary Computation 7(4), 331-352.
  19. Tinós, R., Yang, S., 2007. A self-organizing random immigrants GA for dynamic optimization problems. Genetic Programming and Evolvable Machines 8(3), 255-286.
  20. Yang, S., 2003. Non-stationary problem optimization using the primal-dual genetic algorithm. In Proc. of the 2003 IEEE Congress on Evolutionary Computation, Vol. 3, 2246-2253.
  21. Yang, S. Yao, X., 2005. Experimental study on PBIL algorithms for dynamic optimization problems. Soft Computing 9(11),815-834.
  22. Yang, S., 2008. Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments. Evolutionary Computation 16(3), 385-416.
Download


Paper Citation


in Harvard Style

Fernandes C., Merelo J. and Rosa A. (2010). INVESTIGATING REPLACEMENT STRATEGIES FOR THE ADAPTIVE DISSORTATIVE MATING GENETIC ALGORITHM . In Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010) ISBN 978-989-8425-31-7, pages 104-113. DOI: 10.5220/0003087001040113


in Bibtex Style

@conference{icec10,
author={Carlos M. Fernandes and Juan Julán Merelo and Agostinho C. Rosa},
title={INVESTIGATING REPLACEMENT STRATEGIES FOR THE ADAPTIVE DISSORTATIVE MATING GENETIC ALGORITHM},
booktitle={Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)},
year={2010},
pages={104-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003087001040113},
isbn={978-989-8425-31-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)
TI - INVESTIGATING REPLACEMENT STRATEGIES FOR THE ADAPTIVE DISSORTATIVE MATING GENETIC ALGORITHM
SN - 978-989-8425-31-7
AU - Fernandes C.
AU - Merelo J.
AU - Rosa A.
PY - 2010
SP - 104
EP - 113
DO - 10.5220/0003087001040113