Computer Science ›› 2020, Vol. 47 ›› Issue (5): 217-224.doi: 10.11896/jsjkx.190400039

• Artificial Intelligence • Previous Articles     Next Articles

Coyote Optimization Algorithm Based on Information Sharing and Static Greed Selection

ZHANG Xin-ming1,2, LI Shuang-qian1, LIU Yan1,2, MAO Wen-tao1,2, LIU Shang-wang1, LIU Guo-qi1   

  1. 1 College of Computer and Information Engineering,Henan Normal University,Xinxiang,Henan 453007,China
    2 Engineering Lab of Intelligence Business and Internet of Things of Henan Province,Xinxiang,Henan 453007,China
  • Received:2019-04-07 Online:2020-05-15 Published:2020-05-19
  • About author:ZHANG Xin-ming,born in 1963,professor,master's supervisor,is a member of China Computer Federation.His main research interests include intelligent optimization algorithm and image segmentation
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (U1704158) and Key Research Projects of Higher Education Institutions of Henan Province,China (19A520026).

Abstract: Coyote Optimization Algorithm (COA) is a novel intelligent optimization algorithm recently proposed and has great application potential,but it has some problems such as long running time and insufficient search ability.This paper proposes an improved COA,namely COA based on Information sharing and Static greed selection (ISCOA).Firstly,a new information sharing model is constructed and applied to the growth of all coyotes in the subgroup,the difference of the sharing information is larger in the early growth so as to increase the population diversity,and the one is smaller in the late growth to be beneficial to exploitation.Secondly,a new intra-group growth mode is constructed,that is to say,a new growth way is adopted in the early stage,mainly based on the information sharing model,to strengthen the growth process to improve the exploration ability,and the growth method of the original algorithm is kept in the later stage,mainly based on the guidance of the alpha wolf and the cultural trend,to strengthen the exploiting ability.Finally,the intragroup greedy algorithm of the original algorithm is changed into a sta-tic greedy algorithm to improve the stability of the algorithm,realize the parallel calculation of the objective function,and improve the running speed.A large number of experiment results on the complex functions from CEC2017 test set show that,compared with COA,ISCOA obtains the advantage of 23 and 24 of the 29 10-dimensional and 30-dimensional functions respectively,and its average running time is 86.3% and 85.7% of COA's on the 10-dimensional and 30-dimensional functions respectively,and its running time is decreased.Compared with the 7 state-of-the-art algorithms,the average ranking of ISCOA on the 10-dimensional and 30-dimensional functions are 1.48 and 1.69,ISCOA wins 17 and 18 times ranking the first,respectively,and obtains better optimization results.Experimental results on the practical engineering problem show that ISCOA has achieved the best results.These all proved that ISCOA has stronger search ability and more competitive,and that it has better application prospects.

Key words: Coyote optimization algorithm, Exploitation, Exploration, Greedy algorithm, Swarm intelligence optimization algorithm

CLC Number: 

  • TP181
[1]ZAHNG X M,WANG X,TU Q,et al.Particle swarm optimization algorithm combining example learning and opposition-based learning[J].Journal of Henan Normal University(Natural Scie-nce Edition),2017,45(6):97-105.
[2]YANG J S,ZENG B Q,HU P P.Spectrum allocation and power control based on harmony search algorithm in cognitive radio network[J].Computer Science,2015,42(S2):257-262.
[3]ZHANG X M,CHENG J F,WANG X,et al.Improved Shuffled Frog Leaping Algorithm and Its in Multi-threshold Image Segmentation [J].Computer Science,2018,45(8):54-62.
[4]MIRJALILI S,MIRJALILI S M,LEWIS A.A grey wolf optimizer[J].Advances in Engineering Software,2014,69(3):46-61.
[5]ZAHNG X M,WANG X,KANG Q,et al.Hybrid grey wolf optimizer with artificial bee colony and itsapplication to clustering optimization[J].Acta Electronica Sinca,2018,46(10):2430-2442.
[6]WANG G G,TAN Y.Improving metaheuristic algorithms with information feedback models[J].IEEE Transactions on Cybernetics,2017,99:1-14.
[7]WOLPERT D H,MACREADY W G.No free lunch theorems for optimization[J].IEEE Transactions on Evolutionary Computation,1997,1(1):67-82.
[8]PIEREZAN J,COELHO L D S.Coyote optimization algorithm:a new metaheuristic for global optimization problems[C]//2018 IEEE Congress on Evolutionary Computation (CEC).IEEE,2018:1-8.
[9]AWAD N H,ALI M Z,LIANG J J,et al.Problem definitions and evaluation criteria for the CEC2017 specialsession and competition on single objective bound constrainedreal-parameter numerical optimization[R]. Nanyang Technological University,Singapore,Technical Report,2016.
[10]WANG Y R,YU Y,GAO S C,et al.A hierarchical gravitational search algorithm with an effective gravitational constant [J].Swarm and Evolutionary Computation,2019,46:118-139.
[11]TAN Y,ZHU Y C.Fireworks Algorithm for Optimization[C]//International Conference in Swarm Intelligence.2010:355-364.
[12]RAO R V,SAVSANI V J,VAKHARIA D P.Teaching-learning-based optimization:A novel method for constrainedmechanical design optimization problems[J].Computer-Aided Design,2011,43(3):303-315.
[13]MENG A,LI Z,YIN H,et al.Accelerating particle swarm optimization using crisscross search[J].Information Sciences,2016,329(SI):52-72.
[14]AVDILEK I B.A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems[J].Applied Soft Computing,2018,66:232-249.
[15]DERRAC J,GARCIA S,MOLINA D,et al.A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms[J].Swarm and Evolutionary Computation,2011,1(1):3-18.
[16]BAYKASOGLU A,AKPINAR Ş.Weighted superposition at-traction (WSA):a swarm intelligence algorithm for optimization problems-part 2:constrained optimization[J].Applied Soft Computing,2015,37:396-415.
[17]LU C,GAO L,YI J.Grey wolf optimizer with cellular topological structure[J].Expert Systems with Applications,2018,107:89-114.
[1] ZHANG Chong-yu, CHEN Yan-ming, LI Wei. Task Offloading Online Algorithm for Data Stream Edge Computing [J]. Computer Science, 2022, 49(7): 263-270.
[2] LIU Zhang-hui, ZHENG Hong-qiang, ZHANG Jian-shan, CHEN Zhe-yi. Computation Offloading and Deployment Optimization in Multi-UAV-Enabled Mobile Edge Computing Systems [J]. Computer Science, 2022, 49(6A): 619-627.
[3] HONG Zhi-li, LAI Jun, CAO Lei, CHEN Xi-liang, XU Zhi-xiong. Study on Intelligent Recommendation Method of Dueling Network Reinforcement Learning Based on Regret Exploration [J]. Computer Science, 2022, 49(6): 149-157.
[4] ZHANG Jia-neng, LI Hui, WU Hao-lin, WANG Zhuang. Exploration and Exploitation Balanced Experience Replay [J]. Computer Science, 2022, 49(5): 179-185.
[5] AO Tian-yu, LIU Quan. Upper Confidence Bound Exploration with Fast Convergence [J]. Computer Science, 2022, 49(1): 298-305.
[6] SHEN Xia-jiong, YANG Ji-yong, ZHANG Lei. Attribute Exploration Algorithm Based on Unrelated Attribute Set [J]. Computer Science, 2021, 48(4): 54-62.
[7] HUANG Zhi-yong, WU Hao-lin, WANG Zhuang, LI Hui. DQN Algorithm Based on Averaged Neural Network Parameters [J]. Computer Science, 2021, 48(4): 223-228.
[8] SHANG Xi-xue, HAN Hai-ting, ZHU Zheng-zhou. Mechanism Design of Right to Earnings of Data Utilization Based on Evolutionary Game Model [J]. Computer Science, 2021, 48(3): 144-150.
[9] HUANG Guang-qiu, LU Qiu-qin. Vertical Structure Community System Optimization Algorithm [J]. Computer Science, 2020, 47(4): 194-203.
[10] SUN Zhi-qiang, WAN Liang, DING Hong-wei. Android Malware Detection Method Based on Deep Autoencoder Network [J]. Computer Science, 2020, 47(4): 298-304.
[11] WANG Guo-yin, QU Zhong, ZHAO Xian-lian. Practical Exploration of Discipline Construction of Artificial Intelligence+ [J]. Computer Science, 2020, 47(4): 1-5.
[12] HUANG Guang-qiu,LU Qiu-qin. Protected Zone-based Population Migration Dynamics Optimization Algorithm [J]. Computer Science, 2020, 47(2): 186-194.
[13] ZHENG Tian-jian, HOU Jin-hong, ZHANG Wei, WANG Ju. Finite Basis of Implicational System Associated with Finite Models of Description Logic FL0 Under the Greatest Fixed Point Semantics [J]. Computer Science, 2020, 47(11A): 92-96.
[14] HU Jun-qin, ZHANG Jia-jun, HUANG Yin-hao, CHEN Xing, LIN Bing. Computation Offloading Scheduling Technology for DNN Applications in Edge Environment [J]. Computer Science, 2020, 47(10): 247-255.
[15] LIAO Yong, YANG Xin-yi, XIA Mao-han, WANG Bo, LI Shou-zhi, SHEN Xuan-fan. Improved Tomlinson-Harashima Precoding Based on Greedy Algorithm in High-speed Mobile Scenarios [J]. Computer Science, 2019, 46(8): 121-126.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!