Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems
Open accessThe DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Abstract
In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. In trying to solve constrained optimization problems using deterministic, stochastic optimization methods or hybridization between them, penalty function methods are the most popular approach due to their simplicity and ease of implementation. There are many approaches to handling the existence of the constraints in the constrained problem. The simulated-annealing algorithm (SA) is one of the most successful meta-heuristic strategies. On the other hand, the gradient method is the most inexpensive method among the deterministic methods. In previous literature, the hybrid gradient simulated annealing algorithm (GLMSA) has demonstrated efficiency and effectiveness to solve unconstrained optimization problems. In this paper, therefore, the GLMSA algorithm is generalized to solve the constrained optimization problems. Hence, a new approach penalty function is proposed to handle the existence of the constraints. The proposed approach penalty function is used to guide the hybrid gradient simulated annealing algorithm (GLMSA) to obtain a new algorithm (GHMSA) that finds the constrained optimization problem. The performance of the proposed algorithm is tested on several benchmark optimization test problems and some well-known engineering design problems with varying dimensions. Comprehensive comparisons against other methods in the literature are also presented. The results indicate that the proposed method is promising and competitive. The comparison results between the GHMSA and the other four state-Meta-heuristic algorithms indicate that the proposed GHMSA algorithm is competitive with, and in some cases superior to, other existing algorithms in terms of the quality, efficiency, convergence rate, and robustness of the final result.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This algorithm often identi fi es near-optimal solutions but cannot guarantee that local or global optimality conditions are satis fi ed.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [46]
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
Bat algorithm: a novel approach for global engineering optimization
Yang, X., & Hossein Gandomi, A. (2012) · Engineering Computations · doi:10.1108/02644401211235834 · Cited by 1,751
Evolutionary Algorithms for Constrained Parameter Optimization Problems
Michalewicz, Z., & Schoenauer, M. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.1.1 · Cited by 1,718
Handbook of Parametric and Nonparametric Statistical Procedures: Third Edition
Sheskin, D. J. (2003) · doi:10.1201/9781420036268 · Cited by 1,551
Corana, A., Marchesi, M., Martini, C., & Ridella, S. (1987) · ACM Transactions on Mathematical Software · doi:10.1145/29380.29864 · Cited by 1,531
Simulated annealing: Practice versus theory
Ingber, L. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90204-c · Cited by 1,008
Constrained Optimization Via Genetic Algorithms
Homaifar, A., Qi, C. X., & Lai, S. H. (1994) · SIMULATION · doi:10.1177/003754979406200405 · Cited by 802
Joines, J. A., & Houck, C. R. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.349995 · Cited by 749
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
Michalewicz, Z. (1995) · Evolutionary Programming IV · doi:10.7551/mitpress/2887.003.0018 · Cited by 499
Global optimization and simulated annealing
Dekkers, A., & Aarts, E. (1991) · Mathematical Programming · doi:10.1007/bf01594945 · Cited by 435
Handling Constraints in Genetic Algorithms
Michalewicz, Z., & Janikow, C. Z. (1991) · international conference on Genetic algorithms · Cited by 326
Blended biogeography-based optimization for constrained optimization
Ma, H., & Simon, D. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2010.08.005 · Cited by 281
Constrained optimization based on modified differential evolution algorithm
Mohamed, A. W., & Sabry, H. Z. (2012) · Information Sciences · doi:10.1016/j.ins.2012.01.008 · Cited by 203
Self-citation(1993) · Lecture Notes in Economics and Mathematical Systems · doi:10.1007/978-3-642-46787-5 · Cited by 184
A novel differential evolution algorithm for solving constrained engineering optimization problems
Mohamed, A. W. (2018) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-017-1294-6 · Cited by 166
Self-citationMemetic particle swarm optimization
Petalas, Y. G., Parsopoulos, K. E., & Vrahatis, M. N. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0224-y · Cited by 160
A review on constraint handling strategies in particle swarm optimisation
Jordehi, A. R. (2015) · Neural Computing and Applications · doi:10.1007/s00521-014-1808-5 · Cited by 148
Metaheuristic Algorithms for Convolution Neural Network
Rere, L. M. R., Fanany, M. I., & Arymurthy, A. M. (2016) · Computational Intelligence and Neuroscience · doi:10.1155/2016/1537325 · Cited by 129
Heuristic and Meta-Heuristic Algorithms and Their Relevance to the Real World: A Survey
Desale, S., Rasool, A., Andhale, S., & Rane, P. (2015) · International Journal of Computer Engineering in Research Trends · Cited by 122
Particle swarm optimization for solving engineering problems: A new constraint-handling mechanism
Mazhoud, I., Hadj-Hamou, K., Bigeon, J., & Joyeux, P. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.02.002 · Cited by 119
Stochastic Methods for Global Optimization
Kan, A. H. G. R., & Timmer, G. T. (1984) · American Journal of Mathematical and Management Sciences · doi:10.1080/01966324.1984.10737135 · Cited by 105
A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection
Agrawal, P., Ganesh, T., & Mohamed, A. W. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-05375-8 · Cited by 102
Self-citationLong, W., Liang, X., Cai, S., Jiao, J., & Zhang, W. (2016) · Neural Computing and Applications · doi:10.1007/s00521-016-2357-x · Cited by 100
Kazarlis, S., & Petridis, V. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056864 · Cited by 97
Simulated Annealing in Optimization of Energy Production in a Water Supply Network
Samora, I., Franca, M. J., SCHLEISS, A. J., & Ramos, H. M. (2016) · Water Resources Management · doi:10.1007/s11269-016-1238-5 · Cited by 83
Crossover-based artificial bee colony algorithm for constrained optimization problems
Brajević, I. (2015) · Neural Computing and Applications · doi:10.1007/s00521-015-1826-y · Cited by 74
Optimization of convolutional neural network using microcanonical annealing algorithm
Ayumi, V., Rere, L. M. R., Fanany, M. I., & Arymurthy, A. M. (2016) · International Conference on Advanced Computer Science and Information Systems · doi:10.1109/icacsis.2016.7872787 · Cited by 73
Mohamed, A. A. A., Kamel, S. M., Hassan, M. H., Mosaad, M. I., & Aljohani, M. (2022) · Mathematics · doi:10.3390/math10030361 · Cited by 58
Self-citationAn improved electromagnetism-like mechanism algorithm for constrained optimization
Zhang, C., Li, X., Gao, L., & Wu, Q. H. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.04.028 · Cited by 49
Fish swarm optimization algorithm applied to engineering system design
Lobato, F. S., & Steffen, V. (2013) · Latin American Journal of Solids and Structures · doi:10.1590/s1679-78252014000100009 · Cited by 43
A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems
Abdel-Baset, M., & Hezam, I. M. (2016) · International Journal of Computer Applications · doi:10.5120/ijca2016909119 · Cited by 41
Ghasemishabankareh, B., Li, X., & Özlen, M. (2016) · Information Sciences · doi:10.1016/j.ins.2016.06.047 · Cited by 40
Xu, B., Tao, L., Chen, X., & Wushan, C. (2018) · Soft Computing · doi:10.1007/s00500-017-3001-0 · Cited by 29
A simulated annealing driven multi-start algorithm for bound constrained global optimization
Ali, M. M., & Gabere, M. N. (2009) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2009.11.013 · Cited by 25
Ali, M. M., Golalikhani, M., & Zhuang, J. (2012) · Optimization · doi:10.1080/02331934.2012.655691 · Cited by 22
Datta, R., & Deb, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6252955 · Cited by 22
El-Alem, M. M., Aboutahoun, A. W., & Mahdi, S. (2020) · Soft Computing · doi:10.1007/s00500-020-05303-x · Cited by 22
Self-citationSome modified stochastic global optimization algorithms with applications
Ali, M. M. (1994) · Loughborough University Institutional Repository (Loughborough University) · Cited by 21
Gonzales, G. V., dos Santos, E. D., Emmendörfer, L. R., Isoldi, L. A., Rocha, L. A. O., & Estrada, E. D. S. D. (2015) · Scientia Plena · doi:10.14808/sci.plena.2015.081321 · Cited by 10
Poorjafari, V., Yue, W. L., & Holyoak, N. (2015) · International Journal of Engineering and Technology · doi:10.7763/ijet.2016.v6.888 · Cited by 9
A New Innovative Cooling Law for Simulated Annealing Algorithms
Certa, A., Lupo, T., & Passannanti, G. (2015) · American Journal of Applied Sciences · doi:10.3844/ajassp.2015.370.381 · Cited by 6
Local Convergence of the Interior-Point Newton Method for General Nonlinear Programming
El-Alem, M. M., El‐Sayed, S. M., & El-Sobky, B. (2004) · Journal of Optimization Theory and Applications · doi:10.1023/b:jota.0000025707.93792.be · Cited by 6
Self-citationA New Dynamic Simulated Annealing Algorithm For Global Optimization
Yarmohamadi, H., Kabudian, J., & Mirhosseini, S. H. (2015) · Journal of Mathematics and Computer Science · doi:10.22436/jmcs.014.01.02 · Cited by 6
Application of metaheuristic algorithms for optimal smartphone-photo enhancement
Rere, L. M. R., Fanany, M. I., & Murni, A. (2014) · IEEE Global Conference on Consumer Electronics (GCCE) · doi:10.1109/gcce.2014.7031307 · Cited by 5
Research works printed but not linked: 8
- Nocedal, J., and Wright, S. (2006). Numerical Optimization, Springer Science & Business Media.
- Aarts, E., and Korst, J. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons, Inc.
- Hillier, F.S., and Price, C.C. (2001). International Series in Operations Research & Management Science, Springer.
- Laarhoven, P.J.V., and Aarts, E.H. (1987). Simulated Annealing: Theory and Applications, Springer-Science + Business Media, B. V.
- Chakraborti, 2015, An Elitist Simulated Annealing Algorithm for Solving Multi Objective Optimization Problems in Internet of Things Design, Int. J. Adv. Netw. Appl., 7, 2784
- Parsopoulos, 2002, Particle swarm optimization method for constrained optimization problems, Intell.-Technol.-Theory Appl. New Trends Intell. Technol., 76, 214
- Liang, 2006, Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, J. Appl. Mech., 41, 8
- Rocha, A.M.A., and Fernandes, E.M.d.G. (2009, January 1–5). Self-Adaptive Penalties in the Electromagnetism-like Algorithm for Constrained Global Optimization Problems. Proceedings of the 8th World Congress on Structural and Multidisciplinary Optimization, Lisbon, Portugal.
Cited by
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
Yang, S., Wang, H., Xu, Y., Guo, Y., Pan, L., Zhang, J., Guo, X., Meng, D., & Wang, J. (2023) · Mathematics · doi:10.3390/math11234790 · Cited by 39
Zhou, S. Y., Shi, Y., Wang, D., Xu, X., Xu, M., & Deng, Y. (2024) · Mathematics · doi:10.3390/math12101513 · Cited by 21
Research on schedling optimization of four-way shuttle-based storage and retrieval systems
Mao, J., Cheng, J., Li, X., & Cao, B. (2023) · Scientific Reports · doi:10.1038/s41598-023-31050-8 · Cited by 18
“According to this encoding feature, two points of intersection are chosen in this paper, and the intersection (17) P(xi) = fitness(xi) ∑Ngroup j=1 fitness(j)”
BackgroundSun, Y., Huang, Q., Liu, T., Cheng, Y., & Li, Y. (2023) · Mathematics · doi:10.3390/math11020390 · Cited by 17
Metadata
- Authors
- Alnowibet, K. A., Mahdi, S., El-Alem, M., Abdelawwad, M., & Mohamed, A. W.
- Affiliations
- King Saud University (SA)
- Educational Research and Development Center Sanaa, Sanaa 31220, Yemen
- Alexandria University (EG)
- University of Kassel (DE)
- Cairo University (EG)
- Corresponding author
- Mohamed, Ali Wagdy
- Venue
- Mathematics
- Publisher
- MDPI AG
- Published
- 2022-04-14
- Volume
- 10
- Issue
- 8
- Pages
- 1312
- ISSN
- 2227-7390 (ISSN-L)
- OpenAlex
- W4224307044
- Cited by
- 28
- References
- 49
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 4 · 2023: 11 · 2022: 4
- FWCI
- 1.97
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Mathematics (publishedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- The research publication is funded by Researchers Supporting Program at King Saud University (RSP-2021/305)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Social Sciences › Decision Sciences › Management Science and Operations Research › Simulation Techniques and Applications
- Keywords
- constrained optimization, penalty method, global optimization, metaheuristic algorithms, gradient-based optimization, engineering design problems, benchmark problems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.