A Weighted Local Sharing Technique for Multimodal Optimisation

  • Grant Dick
  • Peter A. Whigham
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5361)


Local sharing is a method designed for efficient multimodal optimisation that combines fitness sharing, spatially-structured populations and elitist replacement. In local sharing the bias toward sharing or spatial effect is controlled by the deme (neighbourhood) size. This introduces an undesirable trade-off; to maximise the sharing effect, deme sizes must be large, but the opposite must be true if one wishes to maximise the influence of spatial population structure. This paper introduces a modification to the local sharing method whereby parent selection and fitness sharing operate at two different spatial levels; parent selection is performed within small demes, while the effect of fitness sharing is weighted according to the distances between individuals in the population structure. The proposed method, as tested on several benchmark problems, demonstrates a level of efficiency and parameter robustness that surpasses the basic local sharing method.


Genetic Algorithm Parent Selection Local Sharing Multimodal Problem Multimodal Optimisation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mayr, E.: Populations, species and evolution; an abridgment of Animal species and evolution. Harvard University Press (1970)Google Scholar
  2. 2.
    Mahfoud, S.W.: Crowding and preselection revisited. In: Männer, R., Manderick, B. (eds.) Parallel problem solving from nature 2, pp. 27–36. North-Holland, Amsterdam (1992)Google Scholar
  3. 3.
    Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multi-modal function optimisation. In: Proc of the 2nd Int. Conf. on Genetic Algorithms and Their Applications, pp. 41–49 (1987)Google Scholar
  4. 4.
    Miller, B.L., Shaw, M.J.: Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: International Conference on Evolutionary Computation, pp. 786–791 (1996)Google Scholar
  5. 5.
    Pétrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 798–803 (1996)Google Scholar
  6. 6.
    Li, J.P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evolutionary Computation 10(3), 207–234 (2002)CrossRefGoogle Scholar
  7. 7.
    Dick, G., Whigham, P.A.: Spatially-structured evolutionary algorithms and sharing: Do they mix? In: Wang, T.D., Li, X., Chen, S.H., Wang, X., Abbass, H.A., Iba, H., Chen, G., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 457–464. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Dick, G., Whigham, P.: Spatially-structured sharing technique for multimodal problems. Journal of Computer Science and Technology 23(1), 64–76 (2008)CrossRefGoogle Scholar
  9. 9.
    Tomassini, M.: Spatially structured evolutionary algorithms. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  10. 10.
    Ishibuchi, H., Doi, T., Nojima, Y.: Effects of using two neighborhood structures in cellular genetic algorithms for function optimization. In: Runarsson, T.P., Beyer, H.G., Burke, E.K., Guervos, J.J.M., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 949–958. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Mahfoud, S.W.: Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, USA, IlliGAL Report 95001 (1995)Google Scholar
  12. 12.
    Goldberg, D.E., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2, pp. 37–46. Elsevier Science Publishers, B. V, Amsterdam (1992)Google Scholar
  13. 13.
    Horn, J., Goldberg, D.E.: Genetic algorithm difficulty and the modality of fitness landscapes. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms 3, pp. 243–269. Morgan Kaufmann, San Francisco (1995)Google Scholar
  14. 14.
    Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Grefenstette, J.J. (ed.) Genetic Algorithms and their Applications (ICGA 1987), pp. 14–21. Lawrence Erlbaum Associates, Hillsdale (1987)Google Scholar
  15. 15.
    Bird, S., Li, X.: Adaptively choosing niching parameters in a PSO. In: Keijzer, M., Cattolico, M., Arnold, D., Babovic, V., Blum, C., Bosman, P., Butz, M.V., Coello Coello, C., Dasgupta, D., Ficici, S.G., Foster, J., Hernandez-Aguirre, A., Hornby, G., Lipson, H., McMinn, P., Moore, J., Raidl, G., Rothlauf, F., Ryan, C., Thierens, D. (eds.) 2006 Genetic and Evolutionary Computation Conference (GECCO 2006), vol. 1, pp. 3–10. ACM Press, Seattle (2006)Google Scholar
  16. 16.
    Deb, K., Goldberg, D.E.: An investigation of niche and species formation in genetic function optimization. In: Schaffer, J.D. (ed.) Proc. of the Third Int. Conf. on Genetic Algorithms, pp. 42–50. Morgan Kaufmann, San Mateo (1989)Google Scholar
  17. 17.
    Horn, J.: The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative populations. PhD thesis, University of Illinois at Urbana Champaign (1997)Google Scholar
  18. 18.
    Watson, J.P.: A performance assessment of modern niching methods for parameter optimization problems. In: Banzhaf, W., Daida, J.M., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M.J., Smith, R.E. (eds.) Proceedings of the 1999 Conference on Genetic and Evolutionary Computation (GECCO 1999), pp. 702–709. Morgan Kaufmann, San Francisco (1999)Google Scholar
  19. 19.
    Mahfoud, S.W.: A comparison of parallel and sequential niching methods. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 136–143. Morgan Kaufmann, San Francisco (1995)Google Scholar
  20. 20.
    Mühlenbein, H.: Parallel genetic algorithms, population genetics and commbinatorial optimization. In: Schaffer (ed.) Proceedings of the Third International Conference on Genetic Algorithms (ICGA 1989), pp. 416–421. Morgan Kaufmann, San Francisco (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Grant Dick
    • 1
  • Peter A. Whigham
    • 1
  1. 1.Department of Information ScienceUniversity of OtagoDunedinNew Zealand

Personalised recommendations