Sharing Functions

Sharing Functions is a computational mechanism in evolutionary algorithms that belongs to the class of niching methods, distinguished by its use of a similarity-based function to penalize population density around individuals, thereby promoting diversity and enabling the discovery of multiple optima in multimodal optimization problems.

11

Publications

2.4K

Citations

30

Authors

16

Institutions

Publications per year

2017–2026

3

Authors

30

  1. SL
    S. L. Ho

    Hong Kong Polytechnic University, Hong Kong SAR China

    1 publications · 35 citations

    1

    h-index

  2. JH
    Jiale Huang

    Guangdong University of Technology, China

    1 publications · 67 citations

    1

    h-index

  3. GN
    Guangzheng Ni

    Zhejiang University, China

    1 publications · 35 citations

    1

    h-index

  4. CP
    Christian Pfeifer

    Leuphana University of Lüneburg, Germany

    1 publications · 23 citations

    1

    h-index

  5. YZ
    Yaxin Zhang

    Technische Universität Dresden, Germany

    1 publications · 34 citations

    1

    h-index

1–5 of 30

Venues

  1. IEEE Transactions on Magnetics

    1 publications · 35 citations

    1

    h-index

  2. Swarm and Evolutionary Computation

    1 publications · 45 citations

    1

    h-index

  3. international conference on Genetic algorithms

    Conference · 1 publications · 1.9K citations

    1

    h-index

  4. Operations Research Letters

    1 publications · 144 citations

    1

    h-index

  5. Journal of Documentation

    1 publications · 13 citations

    1

    h-index

1–5