CoChat

Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems

Open access

The 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

Crossref · 10.3390/math10081312

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 49 references

Research works printed but not linked: 8

  1. Nocedal, J., and Wright, S. (2006). Numerical Optimization, Springer Science & Business Media.
  2. Aarts, E., and Korst, J. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons, Inc.
  3. Hillier, F.S., and Price, C.C. (2001). International Series in Operations Research & Management Science, Springer.
  4. Laarhoven, P.J.V., and Aarts, E.H. (1987). Simulated Annealing: Theory and Applications, Springer-Science + Business Media, B. V.
  5. 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
  6. Parsopoulos, 2002, Particle swarm optimization method for constrained optimization problems, Intell.-Technol.-Theory Appl. New Trends Intell. Technol., 76, 214
  7. Liang, 2006, Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, J. Appl. Mech., 41, 8
  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

See all 28

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
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.