Journals / An International Journal of Optimization and Control: Theories & Applications (IJOCTA) / 2021 / Cilt: 11 - Sayı: 2

Differential gradient evolution plus algorithm for constraint optimizationproblems: A hybrid approach

Pages
158–177
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

To evaluate the efficiency, robustness, andreliability of DGE+ it has been applied on seven benchmark constraint problems,the results of comparison revealed that the proposed algorithm can provide verycompact, competitive and promising performance.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Optimization for all disciplines is very important and applicable.
📊
Key Findings & Data:Optimization hasplayed a key role in practical engineering problems.
💡
Conclusion & Impact:To evaluate the efficiency, robustness, andreliability of DGE+ it has been applied on seven benchmark constraint problems,the results of comparison revealed that the proposed algorithm can provide verycompact, competitive and promising performance.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Optimization for all disciplines is very important and applicable. Optimization hasplayed a key role in practical engineering problems. A novel hybrid meta-heuristicoptimization algorithm that is based on Differential Evolution (DE), GradientEvolution (GE) and Jumping Technique named Differential Gradient EvolutionPlus (DGE+) are presented in this paper. The proposed algorithm hybridizes theabove-mentioned algorithms with the help of an improvised dynamic probabilitydistribution, additionally provides a new shake off method to avoid prematureconvergence towards local minima. To evaluate the efficiency, robustness, andreliability of DGE+ it has been applied on seven benchmark constraint problems,the results of comparison revealed that the proposed algorithm can provide verycompact, competitive and promising performance.

🔖

Cite This Article

TABASSUM, M. F., NAIK, M., AKRAM, S., HASSAN, S., FARMAN, M., AHMAD, H., KARIM, R., NAIK, P. A., YAVUZ, M. (2022). Differential gradient evolution plus algorithm for constraint optimizationproblems: A hybrid approach. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), Cilt: 11 - Sayı: 2, 158–177. https://ajindex.com/articles/440551

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (17)

  1. Khalilpourazari, S. & Khalilpourazary. S. (2018). Optimization of production time in the multi-pass milling process via a robust grey wolf optimizer. Neural Computing and Applications. 29(12), 1321- 1336
  2. Yang, X.-S. (2010). Nature-inspired metaheuristic algorithms. Luniver press
  3. Gandomi, A. H., Yang, X.-S. & Alavi, A. H. (2011). Mixed variable structural optimization using firefly algorithm. Computers & Structures. 89(23-24), 2325- 2336
  4. Zhang, L., et al. (2016). A novel hybrid firefly algorithm for global optimization. PloS one. 11(9), e0163230
  5. Alba, E. & Dorronsoro, B. (2005). The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE transactions on evolutionary computation. 9(2), 126-142
  6. Olorunda, O. and Engelbrecht, A. P. (2008). Measuring exploration/exploitation in particle swarms using swarm diversity. in 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  7. Lozano, M. & García-Martínez, C. (2010). Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. Computers & Operations Research. 37(3), 481-497
  8. Simon, D. (2008). Biogeography-based optimization. IEEE transactions on evolutionary computation. 12(6), 702-713
  9. Storn, R. (1996). On the usage of differential evolution for function optimization. in Proceedings of North American Fuzzy Information Processing. IEEE
  10. Beyer, H.-G. & Schwefel, H.-P. (2002). Evolution strategies–a comprehensive introduction. Natural computing. 1(1), 3-52
  11. Bonabeau, E., Dorigo, M. & Theraulaz, G. (1999). From natural to artificial swarm intelligence. Oxford university press, UK
  12. Koza, J.R. & J.R. Koza. (1992). Genetic programming: On the programming of computers by means of natural selection. MIT press
  13. Alatas, B. (2011). Acroa: Artificial chemical reaction optimization algorithm for global optimization. Expert Systems with Applications. 38(10), 13170-13180
  14. Erol, O. K. & I. Eksin. (2006). A new optimization method: Big bang–big crunch. Advances in Engineering Software. 37(2), 106-111
  15. Rashedi, E., H. Nezamabadi-Pour, & S. Saryazdi. (2009). Gsa: A gravitational search algorithm. Information sciences. 179(13), 2232-2248
  16. Kaveh, A. & M. Khayatazad. (2012). A new metaheuristic method: Ray optimization. Computers & Structures. 112: p. 283-294
  17. Kirkpatrick, S., C. D. Gelatt, & M. P. Vecchi. (1983). Opti