Abstract
An effective metaheuristic algorithm to solve the higher-order boundary value problems, called a genetic programming technique is presented. In this paper, a genetic programming algorithm, which depends on the syntax tree representation, is employed to obtain the analytical solutions of higher- order differential equations with the boundary conditions. The proposed algorithm can be produce an exact or approximate solution when the classical methods lead to unsatisfactory results. To illustrate the efficiency and accuracy of the designed algorithm, several examples are tested. Finally, the obtained results are compared with the existing methods such as the homotopy analysis method, the B-Spline collocation method and the differential transform method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: International Journal of Applied Metaheuristic Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
