IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v29y2018i3d10.1007_s10845-017-1294-6.html
   My bibliography  Save this article

A novel differential evolution algorithm for solving constrained engineering optimization problems

Author

Listed:
  • Ali Wagdy Mohamed

    (Cairo University)

Abstract

This paper introduces a novel differential evolution (DE) algorithm for solving constrained engineering optimization problems called (NDE). The key idea of the proposed NDE is the use of new triangular mutation rule. It is based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best, better and the worst individuals among the three randomly selected vectors. The main purpose of the new approach to triangular mutation operator is the search for better balance between the global exploration ability and the local exploitation tendency as well as enhancing the convergence rate of the algorithm through the optimization process. In order to evaluate and analyze the performance of NDE, numerical experiments on three sets of test problems with different features, including a comparison with thirty state-of-the-art evolutionary algorithms, are executed where 24 well-known benchmark test functions presented in CEC’2006, five widely used constrained engineering design problems and five constrained mechanical design problems from the literature are utilized. The results show that the proposed algorithm is competitive with, and in some cases superior to, the compared ones in terms of the quality, efficiency and robustness of the obtained final solutions.

Suggested Citation

  • Ali Wagdy Mohamed, 2018. "A novel differential evolution algorithm for solving constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 659-692, March.
  • Handle: RePEc:spr:joinma:v:29:y:2018:i:3:d:10.1007_s10845-017-1294-6
    DOI: 10.1007/s10845-017-1294-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-017-1294-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-017-1294-6?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. Kunjie Yu & Xin Wang & Zhenlei Wang, 2016. "An improved teaching-learning-based optimization algorithm for numerical and engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 27(4), pages 831-843, August.
    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. Aggarwal, Sakshi & Mishra, Krishn K., 2023. "X-MODE: Extended Multi-operator Differential Evolution algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 211(C), pages 85-108.
    2. He, Jiao & Jin, Xin & Xie, S.Y. & Cao, Le & Lin, Yifan & Wang, Ning, 2019. "Multi-body dynamics modeling and TMD optimization based on the improved AFSA for floating wind turbines," Renewable Energy, Elsevier, vol. 141(C), pages 305-321.
    3. Zhang, Jinzhong & Zhang, Gang & Kong, Min & Zhang, Tan & Wang, Duansong & Chen, Rui, 2023. "CWOA: A novel complex-valued encoding whale optimization algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 207(C), pages 151-188.
    4. Umesh Balande & Deepti Shrimankar, 2019. "SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems," Mathematics, MDPI, vol. 7(3), pages 1-26, March.
    5. Wenchao Yi & Liang Gao & Zhi Pei & Jiansha Lu & Yong Chen, 2021. "ε Constrained differential evolution using halfspace partition for optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 32(1), pages 157-178, January.
    6. Raghav Prasad Parouha & Pooja Verma, 2022. "An innovative hybrid algorithm for bound-unconstrained optimization problems and applications," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1273-1336, June.
    7. Khalid Abdulaziz Alnowibet & Salem Mahdi & Mahmoud El-Alem & Mohamed Abdelawwad & Ali Wagdy Mohamed, 2022. "Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems," Mathematics, MDPI, vol. 10(8), pages 1-25, April.
    8. Yiying Zhang & Zhigang Jin, 2022. "Comprehensive learning Jaya algorithm for engineering design optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1229-1253, June.
    9. Chao Huang & Zhenyu Zhao & Qingwen Li & Xiong Luo & Long Wang, 2024. "Wind Power Bidding Based on an Ensemble Differential Evolution Algorithm with a Problem-Specific Constraint-Handling Technique," Energies, MDPI, vol. 17(2), pages 1-14, January.

    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. Yu, Kunjie & Liang, J.J. & Qu, B.Y. & Cheng, Zhiping & Wang, Heshan, 2018. "Multiple learning backtracking search algorithm for estimating parameters of photovoltaic models," Applied Energy, Elsevier, vol. 226(C), pages 408-422.
    2. Ivona Brajević & Jelena Ignjatović, 2019. "An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2545-2574, August.
    3. Shunfu Jin & Xiuchen Qie & Wenjuan Zhao & Wuyi Yue & Yutaka Takahashi, 2020. "A clustered virtual machine allocation strategy based on a sleep-mode with wake-up threshold in a cloud environment," Annals of Operations Research, Springer, vol. 293(1), pages 193-212, October.
    4. Lin Sun & Suisui Chen & Jiucheng Xu & Yun Tian, 2019. "Improved Monarch Butterfly Optimization Algorithm Based on Opposition-Based Learning and Random Local Perturbation," Complexity, Hindawi, vol. 2019, pages 1-20, February.
    5. Yu, Kunjie & While, Lyndon & Reynolds, Mark & Wang, Xin & Liang, J.J. & Zhao, Liang & Wang, Zhenlei, 2018. "Multiobjective optimization of ethylene cracking furnace system using self-adaptive multiobjective teaching-learning-based optimization," Energy, Elsevier, vol. 148(C), pages 469-481.
    6. Huazan Liu & Yukang He & Qichao Hu & Jianfei Guo & Lan Luo, 2020. "Risk management system and intelligent decision-making for prefabricated building project under deep learning modified teaching-learning-based optimization," PLOS ONE, Public Library of Science, vol. 15(7), pages 1-15, July.
    7. He, Quanqin & Liu, Hao & Ding, Guiyan & Tu, Liangping, 2023. "A modified Lévy flight distribution for solving high-dimensional numerical optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 376-400.
    8. Hongli Yu & Yuelin Gao & Le Wang & Jiangtao Meng, 2020. "A Hybrid Particle Swarm Optimization Algorithm Enhanced with Nonlinear Inertial Weight and Gaussian Mutation for Job Shop Scheduling Problems," Mathematics, MDPI, vol. 8(8), pages 1-17, August.
    9. Yadong Yu & Haiping Ma & Mei Yu & Sengang Ye & Xiaolei Chen, 2018. "Multipopulation Management in Evolutionary Algorithms and Application to Complex Warehouse Scheduling Problems," Complexity, Hindawi, vol. 2018, pages 1-14, April.
    10. Yu, Kunjie & Qu, Boyang & Yue, Caitong & Ge, Shilei & Chen, Xu & Liang, Jing, 2019. "A performance-guided JAYA algorithm for parameters identification of photovoltaic cell and module," Applied Energy, Elsevier, vol. 237(C), pages 241-257.

    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:spr:joinma:v:29:y:2018:i:3:d:10.1007_s10845-017-1294-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.