IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v339y2018icp323-345.html
   My bibliography  Save this article

Estimation distribution algorithms on constrained optimization problems

Author

Listed:
  • Gao, Shujun
  • de Silva, Clarence W.

Abstract

Estimation distribution algorithm (EDA) is an evolution technique that uses sampling to generate the offspring. Most developed EDAs focus on solving the optimization problems which only have the constraints of variable boundaries. In this paper, EDAs are proposed for solving the constrained optimization problems (COPs) involving various types of constraints. In particular, a modified extreme elitism selection method is designed for EDAs to handle the constraints. This selection extrudes the role of some top best solutions to pull the mean vector of the Gaussian distribution towards these best solutions and makes EDAs form a primary evolutionary direction. The EDAs based on five different Gaussian distribution with this selection are evaluated using a set of benchmark functions and some engineering design problems. It is found that for solving these problems, the EDA that is based on a single multivariate Gaussian distribution model with the modified extreme elitism selection outperforms the other EDAs and some state-of-the-art techniques.

Suggested Citation

  • Gao, Shujun & de Silva, Clarence W., 2018. "Estimation distribution algorithms on constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 323-345.
    • Handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:323-345
    DOI: 10.1016/j.amc.2018.07.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318306027
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.07.037?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Manoj Dhadwal & Sung Jung & Chang Kim, 2014. "Advanced particle swarm assisted genetic algorithm for constrained optimization problems," Computational Optimization and Applications, Springer, vol. 58(3), pages 781-806, July.
    2. Santana, Roberto & Bielza, Concha & Larrañaga, Pedro & Lozano, Jose A. & Echegoyen, Carlos & Mendiburu, Alexander & Armañanzas, Rubén & Shakya, Siddartha, 2010. "Mateda-2.0: A MATLAB Package for the Implementation and Analysis of Estimation of Distribution Algorithms," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 35(i07).
    3. Fuqing Zhao & Zhongshi Shao & Junbiao Wang & Chuck Zhang, 2016. "A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1039-1060, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    2. Qiongfang Li & Yao Du & Zhennan Liu & Zhengmo Zhou & Guobin Lu & Qihui Chen, 2022. "Drought prediction in the Yunnan–Guizhou Plateau of China by coupling the estimation of distribution algorithm and the extreme learning machine," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 113(3), pages 1635-1661, September.
    3. Mohd Shareduwan Mohd Kasihmuddin & Mohd. Asyraf Mansor & Md Faisal Md Basir & Saratha Sathasivam, 2019. "Discrete Mutation Hopfield Neural Network in Propositional Satisfiability," Mathematics, MDPI, vol. 7(11), pages 1-21, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gonzalez-Fernandez, Yasser & Soto, Marta, 2014. "copulaedas: An R Package for Estimation of Distribution Algorithms Based on Copulas," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 58(i09).
    2. Min Dai & Ziwei Zhang & Adriana Giret & Miguel A. Salido, 2019. "An Enhanced Estimation of Distribution Algorithm for Energy-Efficient Job-Shop Scheduling Problems with Transportation Constraints," Sustainability, MDPI, vol. 11(11), pages 1-23, May.
    3. Lulu Song & Ying Meng & Qingxin Guo & Xinchang Gong, 2023. "Improved Differential Evolution Algorithm for Slab Allocation and Hot-Rolling Scheduling Integration Problem," Mathematics, MDPI, vol. 11(9), pages 1-19, April.
    4. Shahed Mahmud & Ripon K. Chakrabortty & Alireza Abbasi & Michael J. Ryan, 2022. "Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 33(7), pages 1939-1966, October.
    5. Margarita Antoniou & Gregor Papa, 2021. "Differential Evolution with Estimation of Distribution for Worst-Case Scenario Optimization," Mathematics, MDPI, vol. 9(17), pages 1-22, September.
    6. Arnaud Flori & Hamouche Oulhadj & Patrick Siarry, 2022. "QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization," Computational Optimization and Applications, Springer, vol. 82(2), pages 525-559, June.
    7. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    8. Mohd Shareduwan Mohd Kasihmuddin & Mohd. Asyraf Mansor & Md Faisal Md Basir & Saratha Sathasivam, 2019. "Discrete Mutation Hopfield Neural Network in Propositional Satisfiability," Mathematics, MDPI, vol. 7(11), pages 1-21, November.

    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:eee:apmaco:v:339:y:2018:i:c:p:323-345. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.