A novel problem-solving method by multi-computational optimisation of artificial neural network for modelling and prediction of the flow erosion processes

10Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This research aims to forecast, using various criteria, the flow of soil erosion that will occur at a particular geographical location. As for the training dataset, 80% of the dataset from the sample sites, four hybrid algorithms, namely heap-based optimizer (HBO), political optimizer (PO), teaching-learning based optimization (TLBO), and backtracking search algorithm (BSA) combined with artificial neural network (ANN) was used to create an erosion susceptibility model and establishes a unique and original approach. After it was confirmed to be successful, the algorithms were applied to create a susceptibility map for this area, demonstrating the integrity of the results. The AUC values were computed for every optimisation algorithm used in this study. The optimal estimated accuracy indices for populations of 450 were determined to be 0.9846 using the BSA-MLP training databases. The maximum AUC value for the HBO-MLP training databases with different swarm sizes was 0.9736. A swarm size of 350–300 is considered optimal for forecasting erosion susceptibility mapping in hybrid models. With the same swarm size constraints, the AUC value for training in the TLBO-MLP scenario was 0.996. After 150 swarm size conditions were used to train the PO-MLP model, the AUC values were 0.9845. According to these findings, the TLBO-MLP and PO-MLP algorithms worked best with populations of 50 and 150, respectively.

Cite

CITATION STYLE

APA

Moayedi, H., Ahmadi Dehrashid, A., & Nguyen Le, B. (2024). A novel problem-solving method by multi-computational optimisation of artificial neural network for modelling and prediction of the flow erosion processes. Engineering Applications of Computational Fluid Mechanics, 18(1). https://doi.org/10.1080/19942060.2023.2300456

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free