Abstract
This paper introduces a novel niching scheme called the q-nearest neighbors replacement (q-NNR) method in the framework of the steady-state GAs (SSGAs) for solving binary multimodal optimization problems. A detailed comparison of the main niching approaches are presented first. The niching paradigm and difference of the selection-recombination genetic algorithms (GAs) and the recombination-replacement SSGAs are discussed. Then the q-NNR is developed by adopting special replacement policies based on the SSGAs; a Boltzmann scheme for dynamically sizing the nearest neighbors set is designed to achieve a speed-up and control the proportion of individuals adapted to different niches. Finally, experiments are carried out on a set of test functions characterized by deception, epistasis, symmetry and multimodality. The results are satisfactory and illustrate the effectivity and efficiency of the proposed niching method.
References
Bäck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary Computation. Institute of Physics, Bristol (2000)
Beasley, D., Bull, D.R., Martin, R.R.: A sequential niche technique for multimodal function optimization. Evol. Comput. 1(2), 10–125 (1993)
Cedeño, W., Vemuri, V.: Analysis of speciation and niching in multi-niche crowding genetic algorithms. Theor. Comput. Sci. 222(1–2), 177–197 (1999)
Cioppa, A.D., Stefano, C., De, Marcelli, A.: On the role of population size and niche radius in fitness sharing. IEEE Trans. Evol. Comput. 8(6), 580–592 (2004)
Davidor, Y.: Epistasis variance: a viewpoint on GA-hardness. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, pp. 23–35. Morgan Kaufmann, San Mateo (1991)
Deb, K., Goldberg, D.E.: An investigation of niche and species formation in genetic function optimization. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 42–50. George Mason University/Morgan Kaufmann, San Mateo (1989)
Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, 2, pp. 93–108 (1992). Also IlliGAL Report No. 91009
Deb, K., Goldberg, D.E.: Sufficient conditions for deceptive and easy binary functions. Ann. Math. Artif. Intell. 10(4), 385–408 (1993)
Deb, K., Horn, J., Goldberg, D.E.: Multimodal deceptive functions. Complex Syst. 7, 131–153 (1993). Also IlliGAL Report No. 92003
De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, MI: Ann Arbor (1975). University Microfilms No. 76-9381
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)
Forrest, S., Smith, R.E., Javornik, B., Perelson, A.S.: Using genetic algorithms to explore pattern recognition in the immune system. Evol. Comput. 1(3), 191–211 (1993)
Gan, J., Warwick, K.: A variable radius niching technique for speciation in genetic algorithms. In: Whitley, D., et al. (eds.) Proceedings of the Genetic and Evolutionary Computational Conference (GECCO2000), pp. 96–103. Morgan Kaufmann, San Mateo (2000)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison–Wesley, New York (1989)
Goldberg, D.E.: Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic, Boston (2002)
Goldberg, D.E., Richardson, J.J.: Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette, J. (ed.) Proceedings of the Second International Conference on Genetic Algorithms (ICGA 2nd), pp. 41–49. Lawrence Erlbaum Associates, Cambridge (1987)
Goldberg, D.E., Wang, L.: Adaptive niching via coevolutionary sharing. In: Quagliarella, D., Periaux, J., Poloni, C., Winter, G. (eds.) Genetic Algorithms in Engineering and Computer Science, pp. 21–38. Wiley, Chichester (1997). Also IlliGAL Report No. 97007
Goldberg, D.E., Deb, K., Korb, B.: Messy genetic algorithms revisited: studies in mixed size and scale. Complex Syst. 4, 415–444 (1990)
Goldberg, D.E., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, 2, pp. 37–46. North-Holland, Amsterdam (1992). Also IlliGAL Report No. 92007
Gudla, P.K., Ganguli, R.: An automated hybrid genetic-conjugate gradient algorithm for multimodal optimization problems. Appl. Math. Comput. 167(2), 1457–1474 (2005)
Harik, G.R.: Finding multimodal solutions using restricted tournament selection. In: Eshelman, L.J. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 24–31. Morgan Kaufmann, San Mateo (1995). Also IlliGAL Report No. 94002
Horn, J.: The nature of niching: genetic algorithms and the evolution of optimal, cooperative populations. Doctoral Dissertation, University of Illinois at Urbana-Champaign, Urbana, IL61801 (1997). Also IlliGAL Report No. 97008
Jelasity, M., Ortigosa, P.M., Garcia, I.: UEGO, an abstract clustering technique for multimodal global optimization. J. Heuristics 7(3), 215–233 (2001)
Li, M., Kou, J.: A novel type of niching methods based on steady-state genetic algorithm. In: Wang, L., Chen, K., Ong, Y.S. (eds.) Advances in Natural Computation: First International Conference on Natural Computation (ICNC 2005). Lecture Notes in Computer Science, vol. 3612/2005, pp. 37–47. Springer, Berlin (2005)
Li, J.-P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evol. Comput. 10(3), 207–234 (2002)
Lin, C.-Y., Yang, Y.-J.: Cluster identification techniques in genetic algorithms for multimodal optimization. Comput. Aided Civ. Infrastruct. Eng. 13(1), 53–62 (1998)
Mahfoud, S.W.: Crowding and preselection revisited. In: Manner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, 2, pp. 27–36. Elsevier, Amsterdam (1992). Also IlliGAL Report No. 92004
Mahfoud, S.W.: Niching methods for genetic algorithms. Doctoral Dissertation, University of Illinois at Urbana-Champaign, Urbana, IL61801 (1995). Also IlliGAL Report No. 95001
Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: deterministic crowding with probabilistic replacement. IlliGAL Report No. 99004 (1999)
Miller, B.L., Shaw, M.J.: Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: Grefenstette, J.J. (ed.) International Conference on Evolutionary Computation, pp. 786–791. IEEE Press, Piscataway (1996). Also IlliGAL Report No. 95010
Naudts, B., Naudts, J.: The effect of spin-flip symmetry on the performance of the simple GA. In: Eiben, A.E. et al. (eds.) Proceedings of the Fifth Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, vol. 1498, pp. 67–76 (1998)
Parzen, E.: On estimation of a probability density function and mode. Ann. Math. Stat. 33, 1065–1076 (1962)
Pétrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Grefenstette, J.J. (ed.) Proceedings of 1996 IEEE International Conference on Evolutionary Computation, pp. 798–803. IEEE Press, Piscataway (1996)
Pelikan, M., Goldberg, D.E.: Genetic algorithms, clustering, and the breaking of symmetry. In: Schoenauer, M. et al. (eds.) Proceedings of Parallel Problem Solving from Nature VI, pp. 385–394. Springer, Berlin (2000). Also IlliGAL Report No. 2000013
Peña, J.M., Lozano, J.A., Larrañaga, P.: Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks. Evol. Comput. 13(1), 43–66 (2005)
Reeves, C., Wright, C.C.: Epistasis in genetic algorithms: an experimental design perspective. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 217–224. Morgan Kaufmann, San Francisco (1995)
Sareni, B., Krähenbühl, L.: Fitness sharing and niching methods revisited. IEEE Trans. Evol. Comput. 2(3), 97–106 (1998)
Sastry, K., Abbass, H.A., Goldberg, D.E., Johnson, D.D.: Sub-structural niching in estimation of distribution algorithms. In: Beyer, H.-G., O’Reilly, U.-M. (eds.) Proceedings of Genetic and Evolutionary Computation Conference, 2005 (GECCO2005), June 25–29, pp. 671–678. ACM Press, Washington (2005). Also IlliGAL Report No. 2005003
Siarry, P., Pétrowski, A., Bessaou, M.: Island model cooperating with speciation for multimodal optimization. In: Schoenauer, M. et al. (eds.) Proceedings of 6th International Conference on Parallel Problem Solving from Nature (PPSN-VI), Parallel Problem Solving from Nature, pp. 437–446. Springer, Paris (2000)
Siarry, P., Pétrowski, A., Bessaou, M.: A multipopulation genetic algorithm aimed at multimodal optimization. Adv. Eng. Softw. 33(4), 207–213 (2002)
Syswerda, G.: A study of reproduction in generational and steady state Genetic Algorithms. In: Rawlings, G.J.E. (eds.) Foundations of Genetic Algorithms (FOGA 1), pp. 94–101. Morgan Kaufmann, San Mateo (1991)
Thomsen, R.: Multimodal optimization using crowding-based differential evolution. In: Proceedings of Congress on Evolutionary Computation, 2004 (CEC2004), vol. 2, June 19–23, pp. 1382–1389. IEEE Press (2004)
Van Hoyweghen, C., Goldberg, D.E., Naudts, B.: Building block superiority, multimodality and synchronization problems. In: Spector, L., et al. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 694–701. Morgan Kaufmann, San Francisco (2001). Also IlliGAL Report No. 2001020
Van Hoyweghen, C., Goldberg, D.E., Naudts, B.: From TwoMax to the Ising model: easy and hard symmetrical problems. In: Langdon, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2002), pp. 626–633. Morgan Kaufmann, San Francisco (2002a). Also IlliGAL Report No. 2001030
Van Hoyweghen, C., Naudts, B., Goldberg, D.E.: Spin-flip symmetry and synchronization. Evol. Comput. 10(4), 317–344 (2002b)
Yin, X., Germany, N.: A fast algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In: Albrecht, R.F., Reeves, C.R., Steel, N.C. (eds.) Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, pp. 450–457. Springer, Berlin (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, M., Kou, J. Crowding with nearest neighbors replacement for multiple species niching and building blocks preservation in binary multimodal functions optimization. J Heuristics 14, 243–270 (2008). https://doi.org/10.1007/s10732-007-9035-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-007-9035-1