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
Parents
11
Computational aspects of the maximum diversity problem
Jay B. Ghosh · Operations Research Letters · 1996 · 144 citations
1–5 of 11
30
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 30
16
National Quemoy University
Jincheng, Taiwan
1 h-index
1 publications
59 citations
Colorado Power Electronics (United States)
Fort Collins, United States
1 h-index
3 publications
102 citations

Northwestern Polytechnical University
Xi'an, China
1 h-index
5 publications
335 citations
University of Colorado Boulder
Boulder, United States
1 h-index
3 publications
102 citations

Zhejiang University
Hangzhou, China
1 h-index
2 publications
70 citations

National Kaohsiung University of Applied Sciences
Kaohsiung City, Taiwan
1 h-index
1 publications
59 citations
Leuphana University of Lüneburg
Lüneburg, Germany
1 h-index
1 publications
23 citations

University of Benin
Benin City, Nigeria
1 h-index
1 publications
13 citations
1–8 of 16
1 publications · 35 citations
1
h-index
1 publications · 45 citations
1
h-index
Conference · 1 publications · 1.9K citations
1
h-index
1 publications · 144 citations
1
h-index
1 publications · 13 citations
1
h-index
1–5