IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/617905.html
   My bibliography  Save this article

Composite Differential Evolution with Modified Oracle Penalty Method for Constrained Optimization Problems

Author

Listed:
  • Minggang Dong
  • Ning Wang
  • Xiaohui Cheng
  • Chuanxian Jiang

Abstract

Motivated by recent advancements in differential evolution and constraints handling methods, this paper presents a novel modified oracle penalty function-based composite differential evolution (MOCoDE) for constrained optimization problems (COPs). More specifically, the original oracle penalty function approach is modified so as to satisfy the optimization criterion of COPs; then the modified oracle penalty function is incorporated in composite DE. Furthermore, in order to solve more complex COPs with discrete, integer, or binary variables, a discrete variable handling technique is introduced into MOCoDE to solve complex COPs with mix variables. This method is assessed on eleven constrained optimization benchmark functions and seven well-studied engineering problems in real life. Experimental results demonstrate that MOCoDE achieves competitive performance with respect to some other state-of-the-art approaches in constrained optimization evolutionary algorithms. Moreover, the strengths of the proposed method include few parameters and its ease of implementation, rendering it applicable to real life. Therefore, MOCoDE can be an efficient alternative to solving constrained optimization problems.

Suggested Citation

  • Minggang Dong & Ning Wang & Xiaohui Cheng & Chuanxian Jiang, 2014. "Composite Differential Evolution with Modified Oracle Penalty Method for Constrained Optimization Problems," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-15, October.
  • Handle: RePEc:hin:jnlmpe:617905
    DOI: 10.1155/2014/617905
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/617905.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/617905.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/617905?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Eryang Guo & Yuelin Gao & Chenyang Hu & Jiaojiao Zhang, 2023. "A Hybrid PSO-DE Intelligent Algorithm for Solving Constrained Optimization Problems Based on Feasibility Rules," Mathematics, MDPI, vol. 11(3), pages 1-34, January.

    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:hin:jnlmpe:617905. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.