Chong, Hue Yee and Yap, Hwa Jen and Tan, Shing Chiang and Yap, Keem Siah and Wong, Shen Yuong (2021) Advances of metaheuristic algorithms in training neural networks for industrial applications. Soft Computing, 25 (16). pp. 11209-11233. ISSN 1432-7643, DOI https://doi.org/10.1007/s00500-021-05886-z.
Full text not available from this repository.Abstract
In recent decades, researches on optimizing the parameter of the artificial neural network (ANN) model has attracted significant attention from researchers. Hybridization of superior algorithms helps improving optimization performance and capable of solving complex applications. As a traditional gradient-based learning algorithm, ANN suffers from a slow learning rate and is easily trapped in local minima when training techniques such as gradient descent (GD) and back-propagation (BP) algorithm are used. The characteristics of randomization and selection of the best or near-optimal solution of metaheuristic algorithm provide an effective and robust solution; therefore, it has always been used in training of ANN to improve and overcome the above problems. New metaheuristic algorithms are proposed every year. Therefore, the review of its latest developments is essential. This article attempts to summarize the metaheuristic algorithms which have been proposed from the year 1975 to 2020 from various journals, conferences, technical papers, and books. The comparison of the popularity of the metaheuristic algorithm is presented in two time frames, such as algorithms proposed in the recent 20 years and those proposed earlier. Then, some of the popular metaheuristic algorithms and their working principle are reviewed. This article further categorizes the latest metaheuristic search algorithm in the literature to indicate their efficiency in training ANN for various industry applications. More and more researchers tend to develop new hybrid optimization tools by combining two or more metaheuristic algorithms to optimize the training parameters of ANN. Generally, the algorithm's optimal performance must be able to achieve a fine balance of their exploration and exploitation characteristics. Hence, this article tries to compare and summarize the properties of various metaheuristic algorithms in terms of their convergence rate and the ability to avoid the local minima. This information is useful for researchers working on algorithm hybridization by providing a good understanding of the convergence rate and the ability to find a global optimum.
| Item Type: | Article |
|---|---|
| Funders: | University of Malaya Impact-Oriented Interdisciplinary Research Grant Programme (IIRG001A-19IISS), Ministry of Higher Education Malaysia (program myBrain15) |
| Uncontrolled Keywords: | Metaheuristic; Artificial neural network; Industry; Training; Optimization |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Engineering |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 24 Feb 2022 02:49 |
| Last Modified: | 24 Feb 2022 02:49 |
| URI: | http://eprints.um.edu.my/id/eprint/26826 |
Actions (login required)
 |
View Item |
