An Efficient Negative Correlation Gravitational Search Algorithm

被引:0
作者
Chen, Huiqin [1 ]
Peng, Qianyi [2 ]
Li, Xiaosi [2 ]
Todo, Yuki [3 ]
Gao, Shangce [2 ]
机构
[1] Jiangsu Agri Anim Husb Vocat Coll, Sch Agr Informat, Taizhou, Jiangsu, Peoples R China
[2] Univ Toyama, Fac Engn, Toyama, Japan
[3] Kanazawa Univ, Fac Elect & Comp Engn, Kanazawa, Ishikawa, Japan
来源
PROCEEDINGS OF THE 2018 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC) | 2018年
基金
加拿大自然科学与工程研究理事会;
关键词
gravitational search algorithm; negative correlation learning; hybridization; optimization; computational intelligence; BRAIN STORM OPTIMIZATION; POPULATION INTERACTION; CHAOS; GSA;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Gravitational search algorithm (GSA) is known as an effective optimization algorithm based on population. To further improve the performance of GSA, taking the combination of diversified search mechanisms into consideration would be a constructive solution for increasing the possibility of obtaining global optimum. In the meantime, the negative correlation search (NCS) algorithm has proven its ability of maintaining diversity effectively to develop the population. Thus, with such inspiration, an improved gravitational search algorithm based on negative correlation learning is proposed in this paper. While gravitational search conducts exploitation in the search space, negative correlation fulfills exploration by encouraging discrepant search behaviors to increase the optimization accuracy. The superiority of the proposed algorithm is demonstrated with experimental results based on several benchmark functions in comparison with its component algorithms.
引用
收藏
页码:73 / 79
页数:7
相关论文
共 49 条
[1]  
[Anonymous], 2013, Int.j.adv.softcomput.appl
[2]   Evolution strategies – A comprehensive introduction [J].
Hans-Georg Beyer ;
Hans-Paul Schwefel .
Natural Computing, 2002, 1 (1) :3-52
[3]   Optimal reactive power dispatch by improved GSA-based algorithm with the novel strategies to handle constraints [J].
Chen, Gonggui ;
Liu, Lilan ;
Zhang, Zhizhong ;
Huang, Shanwai .
APPLIED SOFT COMPUTING, 2017, 50 :58-70
[4]   Compressing Chinese Dark Chess Endgame Databases by Deep Learning [J].
Chen, Jr-Chang ;
Fan, Gang-Yu ;
Chang, Hung-Jui ;
Hsu, Tsan-sheng .
IEEE TRANSACTIONS ON GAMES, 2018, 10 (04) :413-422
[5]   Overlapping Community Change-Point Detection in an Evolving Network [J].
Cheng, Jiujun ;
Chen, Minjun ;
Zhou, MengChu ;
Gao, Shangce ;
Liu, Chunmei ;
Liu, Cong .
IEEE TRANSACTIONS ON BIG DATA, 2020, 6 (01) :189-200
[6]   Connectivity Modeling and Analysis for Internet of Vehicles in Urban Road Scene [J].
Cheng, Jiujun ;
Mi, Hao ;
Huang, Zhenhua ;
Gao, Shangce ;
Zang, Di ;
Liu, Cong .
IEEE ACCESS, 2018, 6 :2692-2702
[7]   Routing in Internet of Vehicles: A Review [J].
Cheng, JiuJun ;
Cheng, JunLu ;
Zhou, MengChu ;
Liu, FuQiang ;
Gao, ShangCe ;
Liu, Cong .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, 16 (05) :2339-2352
[8]   Effects of "rich-gets-richer" rule on small-world networks [J].
Dai, Hongwei ;
Gao, Shangce ;
Yang, Yu ;
Tang, Zheng .
NEUROCOMPUTING, 2010, 73 (10-12) :2286-2289
[9]  
Gao S., 2012, BIOINSPIRED COMPUTAT
[10]   Incorporation of Solvent Effect into Multi-Objective Evolutionary Algorithm for Improved Protein Structure Prediction [J].
Gao, Shangce ;
Song, Shuangbao ;
Cheng, Jiujun ;
Todo, Yuki ;
Zhou, Mengchu .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2018, 15 (04) :1365-1378