IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v13y2022i1p1-17.html
   My bibliography  Save this article

A Metaheuristic Optimization Algorithm for Solving Higher-Order Boundary Value Problems

Author

Listed:
  • Shaza Alturky

    (Aleppo University, Syria)

  • George Albert Toma

    (Aleppo University, Syria)

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.

Suggested Citation

  • Shaza Alturky & George Albert Toma, 2022. "A Metaheuristic Optimization Algorithm for Solving Higher-Order Boundary Value Problems," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 13(1), pages 1-17, January.
    • Handle: RePEc:igg:jamc00:v:13:y:2022:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.292515
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:13:y:2022:i:1:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.