Title of article
An improved imperialist competitive algorithm for solving an inverse form of the Huxley equation
Author/Authors
Mazraeh ، H. Dana Department of Computer and Data Sciences - Faculty of Mathematical Sciences - Shahid Beheshti University , Parand ، K. Department of Computer and Data Sciences - Faculty of Mathematical Sciences - Shahid Beheshti University , Farahani ، H. Department of Computer and Data Sciences - Faculty of Mathematical Sciences - Shahid Beheshti University , Kheradpisheh ، S.R. Department of Computer and Data Sciences - Faculty of Mathematical Sciences - Shahid Beheshti University
From page
681
To page
707
Abstract
In this paper, we present an improved imperialist competitive algorithm for solving an inverse form of the Huxley equation, which is a nonlinear partial differential equation. To show the effectiveness of our proposed algorithm, we conduct a comparative analysis with the original imperialist competitive algorithm and a genetic algorithm. The improvement suggested in this study makes the original imperialist competitive algorithm a more powerful method for function approximation. The numerical results show that the improved imperialist competitive algorithm is an efficient algorithm for determining the unknown boundary conditions of the Huxley equation and solving the inverse form of nonlinear partial differential equations.
Keywords
Huxley equation , Imperialist competitive algorithm , Partial dif ferential equations , Meta , heuristic algorithms , Genetic algorithm
Journal title
Iranian Journal of Numerical Analysis and Optimization
Journal title
Iranian Journal of Numerical Analysis and Optimization
Record number
2760681
Link To Document