TY - JOUR
T1 - Evolutionary multimodal optimization using the principle of locality
AU - Wong, Kachun
AU - Wu, Chunho
AU - Mok, Ricky
AU - Peng, Chengbin
AU - Zhang, Zhaolei
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The authors would like to express their deep gratitudes to the anonymous reviewers for their constructive comments. The authors would also like to thank Ling Qing for his source codes and insightful discussions. Last but not least, the authors would like to thank Kwong-Sak Leung and Man-Hon Wong for their contributions. ZZ acknowledges funding support from a NSERC Discovery Grant (RGPIN 327612-09).
PY - 2012/7
Y1 - 2012/7
N2 - The principle of locality is one of the most widely used concepts in designing computing systems. To explore the principle in evolutionary computation, crowding differential evolution is incorporated with locality for multimodal optimization. Instead of generating trial vectors randomly, the first method proposed takes advantage of spatial locality to generate trial vectors. Temporal locality is also adopted to help generate offspring in the second method proposed. Temporal and spatial locality are then applied together in the third method proposed. Numerical experiments are conducted to compare the proposed methods with the state-of-the-art methods on benchmark functions. Experimental analysis is undertaken to observe the effect of locality and the synergy between temporal locality and spatial locality. Further experiments are also conducted on two application problems. One is the varied-line-spacing holographic grating design problem, while the other is the protein structure prediction problem. The numerical results demonstrate the effectiveness of the methods proposed. © 2012 Elsevier Inc. All rights reserved.
AB - The principle of locality is one of the most widely used concepts in designing computing systems. To explore the principle in evolutionary computation, crowding differential evolution is incorporated with locality for multimodal optimization. Instead of generating trial vectors randomly, the first method proposed takes advantage of spatial locality to generate trial vectors. Temporal locality is also adopted to help generate offspring in the second method proposed. Temporal and spatial locality are then applied together in the third method proposed. Numerical experiments are conducted to compare the proposed methods with the state-of-the-art methods on benchmark functions. Experimental analysis is undertaken to observe the effect of locality and the synergy between temporal locality and spatial locality. Further experiments are also conducted on two application problems. One is the varied-line-spacing holographic grating design problem, while the other is the protein structure prediction problem. The numerical results demonstrate the effectiveness of the methods proposed. © 2012 Elsevier Inc. All rights reserved.
UR - http://hdl.handle.net/10754/562233
UR - https://linkinghub.elsevier.com/retrieve/pii/S0020025511006657
UR - http://www.scopus.com/inward/record.url?scp=84862782212&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2011.12.016
DO - 10.1016/j.ins.2011.12.016
M3 - Article
SN - 0020-0255
VL - 194
SP - 138
EP - 170
JO - Information Sciences
JF - Information Sciences
ER -