IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i11p1126-d287859.html
   My bibliography  Save this article

Memory-Based Evolutionary Algorithms for Nonlinear and Stochastic Programming Problems

Author

Listed:
  • Abdel-Rahman Hedar

    (Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia
    Department of Computer Science, Faculty of Comp. & Info, Assiut University, Assiut 71526, Egypt)

  • Amira A. Allam

    (Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia
    Department of Mathematics, Faculty of Science, Assiut University, Assiut 71516, Egypt)

  • Wael Deabes

    (Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia
    Computers and Systems Engineering Department, Mansoura University, Mansoura 35516, Egypt)

Abstract

In this paper, we target the problems of finding a global minimum of nonlinear and stochastic programming problems. To solve this type of problem, we propose new approaches based on combining direct search methods with Evolution Strategies (ESs) and Scatter Search (SS) metaheuristics approaches. First, we suggest new designs of ESs and SS with a memory-based element called Gene Matrix (GM) to deal with those type of problems. These methods are called Directed Evolution Strategies (DES) and Directed Scatter Search (DSS), respectively, and they are able to search for a global minima. Moreover, a faster convergence can be achieved by accelerating the evolutionary search process using GM, and in the final stage we apply the Nelder-Mead algorithm to find the global minimum from the solutions found so far. Then, the variable-sample method is invoked in the DES and DSS to compose new stochastic programming techniques. Extensive numerical experiments have been applied on some well-known functions to test the performance of the proposed methods.

Suggested Citation

  • Abdel-Rahman Hedar & Amira A. Allam & Wael Deabes, 2019. "Memory-Based Evolutionary Algorithms for Nonlinear and Stochastic Programming Problems," Mathematics, MDPI, vol. 7(11), pages 1-25, November.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:11:p:1126-:d:287859
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/11/1126/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/11/1126/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Palanivel Kaliyaperumal & Amrit Das, 2022. "A Mathematical Model for Nonlinear Optimization Which Attempts Membership Functions to Address the Uncertainties," Mathematics, MDPI, vol. 10(10), pages 1-20, May.

    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:gam:jmathe:v:7:y:2019:i:11:p:1126-:d:287859. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.