Generalized simulated annealing for global optimization: The GenSA package

R Journal

Volumn 5, Issue 1, 2013, Pages 13-28

  Xiang, Yang ^a   Gubian, Sylvain ^a   Suomela, Brian ^a   Hoeng, Julia ^a  

^a PHILIP MORRIS PRODUCTS S A   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883248486     PISSN: None     EISSN: 20734859     Source Type: Journal    
DOI: 10.32614/rj-2013-002     Document Type: Article

References (41)

1. F. P. Agostini, D. D. O. Soares-Pinto, M. A. Moret, C. Osthoff, and P. G. Pascutti. Generalized simulated annealing applied to protein folding studies. Journal of Computational Chemistry, 27:1142-1155, 2006. [p13]
2. E. Altschuler and A. Pérez-Garrido. Defect-free global minima in thomson's problem of charges on a sphere. Physical Review E, 73(3):036108, 2006. [p23]
3. E. L. Altschuler, T. J.Williams, E. R. Ratner, F. Dowla, and F.Wooten. Method of constrained global optimization. Phys. Rev. Lett., 72:2671-2674, Apr 1994. doi: 10.1103/PhysRevLett.72.2671. URL http://link.aps.org/doi/10.1103/PhysRevLett.72.2671. [p23]
4. D. Ardia, K. Boudt, P. Carl, K. M. Mullen, and B. G. Peterson. Differential evolution with DEoptim. The R Journal, 3, 2011. [p14, 16, 21, 22]
5. R. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM Journal on Scientific Computing, 16(5):1190-1208, 1995. [p17]
6. J. O. Cerdeira, P. D. Silva, J. Cadima, and M. Minhoto. subselect: Selecting variable subsets, 2011. URL http://CRAN.R-project.org/package=subselect. R package version 0.11-1. [p14]
7. D. Cvijovic and J. Klinowski. Taboo search: An approach to the multiple minima problem. Science, 267:664-666, 1995. [p13]
8. D. Cvijovic and J. Klinowski. Taboo search: An approach to the multiple-minima problem for continuous functions. In R. H. Pardalos Pm, editor, Handbook of Global Optimization, volume 2, pages 387-406. Kluwer Academic Publisher, 2002. [p13]
9. T. Erber and G. M. Hockney. Equilibrium configurations of n equal charges on a sphere. Journal of Physics A: Mathematical and General, 24:L1369, 1991. [p23]
10. E. Figielska. A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources. Computers & Industrial Engineering, 56(1):142-151, 2009. [p14]
11. D. Fouskakis and D. Draper. Stochastic optimization: a review. International Statistical Review, 70(3): 315-349, 2002. [p13]
12. F. Glover, E. Taillard, and E. Taillard. A user's guide to tabu search. Annals of operations research, 41(1): 1-28, 1993. [p13]
13. V. D. Guire, M. Caron, N. Scott, C. Menard, M. F. Gaumont-Leclerc, P. Chartrand, F. Major, and G. Ferbeyre. Designing small multiple-target artificial rnas. Nucleic Acids Research, 38(13):e140, 2010. [p13]
14. J. H. Holland. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, 1975. [p13]
15. C. Ji-Sheng. Ground state energy of unitary fermion gas with the thomson problem approach. Chinese Physics Letters, 24:1825, 2007. [p23]
16. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220: 671-680, 1983. [p13, 14]
17. Y. Levin and J. Arenzon. Why charges go to the surface: A generalized thomson problem. EPL (Europhysics Letters), 63:415, 2003. [p23]
18. W. Mebane Jr and J. Sekhon. Genetic optimization using derivatives: the rgenoud package for r. Journal of Statistical Software, 42(11):1-26, 2011. [p14, 16, 17, 18]
19. J. R. Morris, D. M. Deaven, and K. M. Ho. Genetic-algorithm energy minimization for point charges on a sphere. Physical Review B, 53:1740-1743, 1996. [p23]
20. K. Mullen, D. Ardia, D. Gil, D. Windover, and J. Cline. Deoptim: An r package for global optimization by differential evolution. Journal of Statistical Software, 40(6):1-26, 2011. URL http://www.jstatsoft.org/v40/i06/. [p14, 16, 21]
21. L. Murphy. likelihood: Methods for maximum likelihood estimation, 2008. R package version 1.4. [p14]
22. J. C. Nash. Compact numerical methods for computers: linear algebra and function minimisation. Taylor & Francis, 1990. ISBN 978-0852743195. [p17]
23. S. Pavlidis, A. Payne, and S. Swift. Multi-membership gene regulation in pathway based microarray analysis. Algorithms for Molecular Biology, 6(1):22, 2011. ISSN 1748-7188. doi: 10.1186/1748-7188-6-22. URL http://www.almob.org/content/6/1/22. [p14]
24. M. J. D. Powell. The bobyqa algorithm for bound constrained optimization without derivatives. Report No. DAMTP, 2009/NA06, Centre for Mathematical Sciences, University of Cambridge, 2009. [p14, 17]
25. P. Serra, A. F. Stanton, and S. Kaisb. Comparison study of pivot methods for global optimization. Journal of Chemical Physics, 106:7170-7177, 1997. [p13, 14, 18]
26. P. Sólymos. dclone: Data cloning in R. The R Journal, 2(2):29-37, 2010. URL http://journal.rproject. org/. [p14]
27. R. Storn and K. Price. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11:341-359, 1997. [p13]
28. H. Szu and R. Hartley. Fast simulated annealing. Physics Letters A, 122:157-162, 1987. [p14]
29. S. Theussl. CRAN Task View: Optimization and Mathematical Programming, 04 2011. URL http://cran.rproject.org/web/views/Optimization.html. [p14]
30. D. Thompson and G. Bilbro. Comparison of a genetic algorithm with a simulated annealing algorithm for the design of an atm network. Communications Letters, IEEE, 4(8):267-269, 2000. [p14]
31. J. J. Thomson. On the structure of the atom: an investigation of the stability and periods of oscillation of a number of corpuscles arranged at equal intervals around the circumference of a circle; with application of the results to the theory of atomic structure. Philosophical Magazine, 7:237-265, 1904. [p23]
32. C. Tsallis and D. A. Stariolo. Generalized simulated annealing. Physica A, 233:395-406, 1996. [p14, 15]
33. J. VanDerWal and S. Januchowski. ConsPlan: Conservation Planning Tools, 2010. R package version 0.1. [p14]
34. D. Wales and S. Ulker. Structure and dynamics of spherical crystals characterized for the thomson problem. Physical Review B, 74(21):212101, 2006. [p23]
35. D.Wales, H. McKay, and E. Altschuler. Defect motifs for spherical topologies. Physical Review B, 79 (22):224115, 2009. [p23]
36. Y. Xiang and X. G. Gong. Efficiency of generalized simulated annealing. Physical Review E, 62:4473-4476, 2000a. [p13, 14, 15, 23]
37. Y. Xiang and X. G. Gong. Generalized simulated annealing method and its application. Progress In Physics, 20:319-334, 2000b. [p14]
38. Y. Xiang, D. Y. Sun, W. Fan, and X. G. Gong. Generalized simulated annealing algorithm and its application to the thomson model. Physics Letters A, 233:216-220, 1997. [p13, 14, 15, 23]
39. Y. Xiang, D. Y. Sun, and X. G. Gong. Generalized simulated annealing studies on structures and properties of nin (n=2-55) clusters. Journal of Physical Chemistry A, 104:2746-2751, 2000. [p13, 15]
40. X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82-102, 1999. [p17]
41. C. Zhu, R. Byrd, P. Lu, and J. Nocedal. Algorithm 778: L-bfgs-b: Fortran subroutines for large-scale bound-constrained optimization. ACM Transactions on Mathematical Software (TOMS), 23(4):550-560, 1997. [p17]