The satin bower bird optimization algorithm is a new meta-heuristic optimization algorithm. Due to its slow convergence rate and low optimization accuracy
a satin bower bird optimization based on adaptive t-distribution mutation (tSBO)algorithm is proposed. In the tSBO algorithm
an adaptive t distribution mutation operator is introduced
and the number of iterations of the algorithm is used as the parameter of the degree of freedom of the t distribution to enhance the diversity of the population and prevent the algorithm from falling into the local optimum.The improved algorithm is compared with FPA
BA and basic SBO algorithm through six standard test functions
and the simulation results show that the improved algorithm is feasible and effective. Compared with the basic SBO algorithm
the convergence precision and robustness are greatly improved.
关键词
Keywords
references
Yang X S. Flower pollination algorithm for global optimization[C]// International Conference on Unconventional Computation and Natural Computation. Springer-Verlag, 2012: 240-249.
Moosavi S H S, Bardsiri V K. Satin bowerbird optimizer: A new optimization algorithm to optimize ANFIS for software development effort estimation[J]. Engineering Applications of Artificial Intelligence, 2017, 60:1-15. DOI: 1
王梓坤.概率论基础及其应用[M].科学出版社, 1979.
Borgia G. Bower destruction and sexual competition in the satin bowerbird (Ptilonorhynchusviolaceus)[J]. Behavioral Ecology % Sociobiology, 1985, 18(2):91-100. DOI: 91
Zheng Y J.Waterwave optimization:A new nature-inspired meta-heuristic[J].Computers % Operations Research, 2015, 55(1):1-11. DOI: 1
Yang X S. A New Meta-heuristic Bat-Inspired Algorithm[J]. Computer Knowledge % Technology, 2010, 284:65-74. DOI: 65
MirjaliliS.Dragonfly algorithm:a new meta-heuristic optimization technique for solving single-objective, discrete, andmulti-objective problems[J].Neural Computing % Applications, 2016, 27(4):1053-1073. DOI: 1053
Mirjalili S, Mirjalili S M, Lewis A. Grey wolf optimizer[J].Advances in Engineering Software, 2014, 69(3): 46-61. DOI: 46