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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems. https://app.cochat.ai/papers/10.3390/math10081312
- The paper
- Alnowibet, K. A., Mahdi, S., El-Alem, M., Abdelawwad, M., & Mohamed, A. W. (2022). Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems. Mathematics. https://doi.org/10.3390/math10081312
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.