An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems

Document Type : Research Article

Authors

• H. Dana Mazraeh
• R. Pourgholi

Damghan University

10.22067/ijnao.v8i2.64202

Abstract

In this paper a hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) simplex search method is combined with least squares method for the determination of temperature in some nonlinear inverse parabolic problems (NIPP). The performance of hybrid algorithm is established with some examples of NIPP. Results show that hybrid algorithm is better than GA and NM separately. Numerical results are obtained by implementation expressed algorithms on 2.20GHz clock speed CPU.

Keywords

• Hybrid
• NIPP
• Nonlinear inverse parabolic problem
• Genetic algorithm
• Nelder–Mead
• The least squares method

20.1001.1.24236977.2018.8.2.7.5

---

References

1. Babolian, E. and Saeidian, J. Analytic approximate solutions to Burgers, Fisher, Huxley equations and two combined forms of these equations, Commun. Nonlinear Sci. Numer. Simulat., 14 (2009), 1984–1992.

2. Cabeza, J.M.G., Garcia, J.A.M., and Rodriguez, A.C. A Sequential Algorithm of Inverse Heat Conduction Problems Using Singular Value Decom position, Int. J. Thermal Sci., 44 (2005), 235–244.

3. Cant´u-Paz, E. A Summary of Research on Parallel Genetic Algorithms, IlliGAL Report No 95007, University of Illinois, 1995.

4. Chiwiacowsky, L.D., de Campos Velho, H.F., Preto, A.J., and Stephany, S. Identifying initial condition in heat conduction transfer by a genetic algorithm: a parallel approach, in: 24th Iberian Latin American Congress on Computational Methods in Engineering, Ouro Preto, Brazil, 2003.

5. Holland, J.H. Adaptation in Natural and Artificial System, University of Michigan Press, Ann Arbor, 1975.

6. Katari, V., Malireddi, S., and Srujan Kollisetty, V.N.K., An efficient hy brid algorithm for data clustering using improved genetic algorithm and Nelder Mead simplex search, International Conference on Computational Intelligence and Multimedia Applications, 2007.

7. Levine, D. A parallel genetic algorithm for the set partitioning problems, Mathematics and Computer Science Division, Argone National Labora tory Rept., University of Illinois, 1994.

8. Liu, F.-B. A modified genetic algorithm for solving the inverse heat transfer problem of estimating plan heat source, Int. J. Heat and Mass Transfer, 51 (2008), 3745–3752.

9. Nelder, J. A. and Mead, R. A simplex method for function minimization, Comput. J. 7 (1965), no. 4, 308–313.

10. Olsson, D. M. and Nelson, L. S. The Nelder–Mead simplex procedure for function minimization, Technometrics, 7 (1965) 308–313.

11. Pourgholi, R., Tavallaei, N., and Foadian, S. application of Haar basis method for solving some ill-posed inverse problems, J. Math. Chem., 8(50) (2012), 2317–2337.

12. Shahrezaee, A. M. and Hoseini nia, M. Solution of Some Parabolic Inverse Problems by Adomian Decomposition Method, Appl. Math. Sci., 5(50)(2011), 3949–3958.

13. Sharapov R. R. and Lapshin A. V. Convergence of Genetic Algorithms, Pattern Recognition and Image Analysis, 16(3) (2006), 392–397.

14. Spendley, W., Hext, G. R., and Himsworth, F. R. Sequential application of simplex designs in optimization and evolutionary operation. Technometrics, 4(4) (1962), 441–461.

15. Mckinnon K. I. M. Convergence of the Nelder–Mead simplex method to a nonstationary point, SIAM J. Optim., 9(1) (1998), 148–158.

16. Powell, M.J.D. On Search Directions for Minimization Algorithms, Math ematical Programming, 4(2) (1973), 193–201.

17. Walsh, G. R. An Introduction to Linear Programming, ISBN 0-471-90719 7 (Wiley), 2nd edition, 1985