The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Generalized Simulated Annealing for Global Optimization: The GenSA Package
Open accessAbstract
Many problems in statistics, finance, biology, pharmacology, physics, mathematics, economics, and chemistry involve determination of the global minimum of multidimensional functions.R packages for different stochastic methods such as genetic algorithms and differential evolution have been developed and successfully used in the R community.Based on Tsallis statistics, the R package GenSA was developed for generalized simulated annealing to process complicated non-linear objective functions with a large number of local minima.In this paper we provide a brief introduction to the R package and demonstrate its utility by solving a non-convex portfolio optimization problem in finance and the Thomson problem in physics.GenSA is useful and can serve as a complementary tool to, rather than a replacement for, other widely used R packages for optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P., & Nocedal, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/279232.279236 · Cited by 3,462
The BOBYQA algorithm for bound constrained optimization without derivatives
Powell, M. J. D. (2009) · Cited by 1,094
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
Thomson, J. J. (1904) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440409463107 · Cited by 719
Cited by
Yin, Z., Jin, Y., Shen, J. S., & Hicher, P. (2018) · International Journal for Numerical and Analytical Methods in Geomechanics · doi:10.1002/nag.2714 · Cited by 282
Epigenetic encoding, heritability and plasticity of glioma transcriptional cell states
Chaligne, R., Gaiti, F., Silverbush, D., Schiffman, J. S., Weisman, H. R., Kluegel, L., Gritsch, S., Deochand, S. D., Gonzalez Castro, L. N., Richman, A. R., et al. (2021) · Nature Genetics · doi:10.1038/s41588-021-00927-7 · Cited by 258
An integrated phenology modelling framework in r
Hufkens, K., Basler, D., Milliman, T., Melaas, E. K., & Richardson, A. D. (2018) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.12970 · Cited by 258
Metadata
- Authors
- Xiang, Y., Gubian, S., Suomela, B., & Hoeng, J.
- Venue
- The R Journal
- Publisher
- The R Foundation
- Published
- 2013
- Volume
- 5
- Issue
- 1
- Pages
- 13
- ISSN
- 2073-4859 (ISSN-L)
- OpenAlex
- W2786029688
- Cited by
- 372
- References
- 29
- FWCI
- 11.41
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Generalized Simulated Annealing for Global Optimization: The GenSA Package. https://app.cochat.ai/papers/10.32614/rj-2013-002
- The paper
- Xiang, Y., Gubian, S., Suomela, B., & Hoeng, J. (2013). Generalized Simulated Annealing for Global Optimization: The GenSA Package. The R Journal. https://doi.org/10.32614/rj-2013-002
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.