An improved imperialist competitive algorithm for solving an inverse form of the Huxley equation

Document Type : Research Article

Authors

• H. Dana Mazraeh ¹
• K. Parand ^{1, 2}
• H. Farahani ¹
• S.R. Kheradpisheh ¹

¹ Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C. Tehran, Iran.

² Department of Cognitive Modeling, Institute for Cognitive and Brain Sciences, Shahid Beheshti University, G.C. Tehran, Iran.

10.22067/ijnao.2024.86692.1384

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 differential equations
• Meta-heuristic algorithms
• Genetic algorithm

Main Subjects

• Numerical methods for differential equations and its applications

---

References

[1] Abbasi Molai, A. and Dana Mazraeh, H., A modified imperialist com-petitive algorithm for solving nonlinear programming problems subject to mixed fuzzy relation equations, Int. J. Nonlinear Anal. Appl. 14(3)(2023), 19–32.
[2] Abdollahi, M., Isazadeh, A. and Abdollahi, D. Imperialist competitive algorithm for solving systems of nonlinear equations, Comput. Math. Appl. 65(12) (2013), 1894–1908.
[3] Aliyari Boroujeni, A., Pourgholi, R. and Tabasi, S.H. A new im-proved teaching–learning-based optimization (ITLBO) algorithm for solv-ing nonlinear inverse partial differential equation problems, Comput. Appl. Math. 42(2) (2023), 99.
[4] Atashpaz-Gargari, E. and Lucas, C. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition, In 2007 IEEE, congress on evolutionary computation (pp. 4661-4667). IEEE, 2007.
[5] Babolian, E. and Saeidian, J. Analytic approximate solutions to Burgers, Fisher, Huxley equations and two combined forms of these equations, Commun. Nonlinear Sci. Numer. Simul. 14(5) (2009), 1984–1992.
[6] Barrios, D., Malumbres, L. and Rios, J. Convergence conditions of ge-netic algorithms, Int. J. Comput. Math. 68(3-4) (1998), 231–241.
[7] Bilel, N., Mohamed, N., Zouhaier, A. and Lotfi, R. An improved imperi-alist competitive algorithm for multi-objective optimization, Eng. Optim. 48(11) (2016), 1823–1844.
[8] Cai, J., Yang, H., Lai, T. and Xu, K. A new approach for optimal chiller loading using an improved imperialist competitive algorithm, Energy and Build. 284 (2023), 112835.
[9] Dai, Y.D., Zhang, H.L., Yuan, Y.P., et al. The traveling solution of Hux-ley equation (in Chinese), Heilongjiang Sci. Technol. Inf. 11, 57 (2016).
[10] Dana Mazraeh, H., Kalantari, M., Tabasi, S.H., Afzal Aghaei, A., Kalan-tari, Z. and Fahimi, F. Solving Fredholm integral equations of the second kind using an improved cuckoo optimization algorithm, Glob. Anal. Dis-cret. Math. 7(1) (2022), 33–52.
[11] Eiben, A.E. and Smith, J.E. Introduction to evolutionary computing, Springer, 2015.
[12] Fathy, A. and Rezk, H. Parameter estimation of photovoltaic system using imperialist competitive algorithm, Renew. Energy, 111 (2017), 307–320.

[13] Ghasemi, M., Ghavidel, S., Ghanbarian, M.M., Massrur, H.R. and Gharibzadeh, M. Application of imperialist competitive algorithm with its modified techniques for multi-objective optimal power flow problem: a comparative study, Inf. Sci. 281 (2014), 225–247.
[14] Girosi, F., Jones, M. and Poggio, T. Regularization theory and neural networks architectures, Neural Comput. 7(2) (1995), 219–269.
[15] Holland, J.H. Adaptation in natural and artificial systems, year 1975, publisher: University of Michigan Press.
[16] Loyinmi, A.C. and Akinfe, T.K. An algorithm for solving the Burgers–Huxley equation using the Elzaki transform, SN Appl. Sci. 2(1) (2020), 7.
[17] Mazraeh, H.D. and Pourgholi, R. An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems, Iranian Journal of Numerical Analysis and Optimization 8(2) (2018), 119–140.
[18] Molla-Alizadeh-Zavardehi, S., Tavakkoli-Moghaddam, R. and Lotfi, F.H. A modified imperialist competitive algorithm for scheduling single batch-processing machine with fuzzy due date, The International Journal of Advanced Manufacturing Technology 85 (2016), 2439–2458.
[19] Nemati, K., Shamsuddin, S.M. and Darus, M. An optimization technique based on imperialist competition algorithm to measurement of error for solving initial and boundary value problems, Measurement 48 (2014), 96–108.
[20] Pourgholi, R., Dana, H. and Tabasi, S.H. Solving an inverse heat con-duction problem using genetic algorithm: sequential and multi-core par-allelization approach, Appl. Math. Model. 38(7-8) (2014), 1948–1958.
[21] Rarità, L. A genetic algorithm to optimize dynamics of supply chains, In Optimization in Artificial Intelligence and Data Sciences: ODS, First Hybrid Conference, Rome, Italy, September 14-17, 2021 (pp. 107–115).
Cham: Springer International Publishing, 2022.

[22] Rarità, L., Stamova, I. and Tomasiello, S. Numerical schemes and ge-netic algorithms for the optimal control of a continuous model of supply chains, Appl. Math. Comput. 388 (2021), 125464.
[23] Razzaghpour, M. and Rusu, A. Analog circuit optimization via a modified Imperialist Competitive Algorithm, In 2011 IEEE International Sympo-sium of Circuits and Systems (ISCAS) (pp. 2273–2276). IEEE, 2011.
[24] Rooholamini, F., Afzal Aghaei, A., Hasheminejad, S.M.H., Azmi, R. and Soltani, S. Developing Chimp Optimization Algorithm for Function Estimation Tasks, Computational Mathematics and Computer Modeling with Applications (CMCMA) (2023), 34–44.
[25] Sharifi, M. and Mojallali, H. Multi-objective modified imperialist compet-itive algorithm for brushless DC motor optimization, IETE J. Res. 65(1) (2019), 96–103.
[26] Smith, G.D. Numerical Solution of Partial Differential Equations: Fi-nite Difference Methods, Oxford Applied Mathematics and Computing Science Series, Third Edition, year 1986, publisher: Oxford University Press.
[27] Tang, Y. and Zhou, F. An improved imperialist competition algorithm with adaptive differential mutation assimilation strategy for function op-timization, Expert Syst. Appl. 211 (2023), 118686.
[28] Tomasiello, S. Numerical solutions of the Burgers–Huxley equation by the IDQ method, Int. J. Comput. Math. 87(1) (2010), 129–140.
[29] Tomasiello, S. DQ based methods: theory and application to engineering and physical sciences, In Handbook of Research on Computational Sci-ence and Engineering: Theory and Practice (pp. 316–346). IGI Global. 2012.
[30] Wang, X.Y. Nerve propagation and wall in liquid crystals, Phys. Lett. A, 112(8) (1985), 402–406.
[31] Xu, S., Wang, Y. and Lu, P. Improved imperialist competitive algorithm with mutation operator for continuous optimization problems, Neural Comput. Appl. 28 (2017), 1667–1682.

[32] Yousefi, M., Yousefi, M. and Darus, A.N. A modified imperialist compet-itive algorithm for constrained optimization of plate-fin heat exchangers, Proc. Inst. Mech. Eng. A: J. Power Energy 226(8) (2012), 1050–1059.
[33] Zandieh, M., Khatami, A.R. and Rahmati, S.H.A. Flexible job shop scheduling under condition-based maintenance: improved version of im-perialist competitive algorithm, Appl. Soft Comput. 58, (2017), 449–464.
[34] Zhang, Y., Hu, X. and Wu, C. Improved imperialist competitive algo-rithms for rebalancing multi-objective two-sided assembly lines with space and resource constraints, Int. J. Prod. Res. 58(12) (2020), 3589–3617.
[35] Zhang, Y., Wang, Y. and Peng, C. Improved imperialist competitive algorithm for constrained optimization, In 2009 International Forum on Computer Science-Technology and Applications (Vol. 1, pp. 204-207). IEEE, 2009.