Selfish herds optimization algorithm with orthogonal design and information update for training multi-layer perceptron neural network

作者:Ruxin Zhao, Yongli Wang, Peng Hu, Hamed Jelodar, Chi Yuan, YanChao Li, Isma Masood, Mahdi Rabbani

摘要

Selfish herd optimization algorithm is a novel meta-heuristic optimization algorithm, which simulates the group behavior of herds when attacked by predators in nature. With the further research of algorithm, it is found that the algorithm cannot get a better global optimal solution in solving some problems. In order to improve the optimization ability of the algorithm, we propose a selfish herd optimization algorithm with orthogonal design and information update (OISHO) in this paper. Through using orthogonal design method, a more competitive candidate solution can be generated. If the candidate solution is better than the global optimal solution, it will replace the global optimal solution. At the same time, at the end of each iteration, we update the population information of the algorithm. The purpose is to increase the diversity of the population, so that the algorithm expands its search space to find better solutions. In order to verify the effectiveness of the proposed algorithm, it is used to train multi-layer perceptron (MLP) neural network. For training multi-layer perceptron neural network, this is a challenging task to present a satisfactory and effective training algorithm. We chose twenty different datasets from UCI machine learning repository as training dataset, and the experimental results are compared with SSA, GG-GSA, GSO, GOA, WOA and SOS, respectively. Experimental results show that the proposed algorithm has better optimization accuracy, convergence speed and stability compared with other algorithms for training multi-layer perceptron neural network.

论文关键词:Selfish herd optimization algorithm, Orthogonal design, Multi-layer perceptron (MLP) neural network, Information update, Meta-heuristic optimization algorithm

论文评审过程:

论文官网地址:https://doi.org/10.1007/s10489-018-1373-1