Generalized Simulated Annealing for Global Optimization: The GenSA Package
暂无分享,去创建一个
Yang Xiang | Julia Hoeng | Sylvain Gubian | Brian P. Suomela | Brian Suomela | J. Hoeng | Y. Xiang | Sylvain Gubian
[1] D. M. Deaven,et al. Genetic-algorithm energy minimization for point charges on a sphere. , 1996, Physical review. B, Condensed matter.
[2] X. Gong,et al. Generalized Simulated Annealing Studies on Structures and Properties of Nin (n ) 2-55) Clusters , 2000 .
[3] Sabre Kais,et al. Comparison study of pivot methods for global optimization , 1997 .
[4] H. Szu. Fast simulated annealing , 1987 .
[5] David J. Wales,et al. Defect motifs for spherical topologies , 2009 .
[6] D. Draper,et al. Stochastic Optimization: a Review , 2002 .
[7] M. Powell. The BOBYQA algorithm for bound constrained optimization without derivatives , 2009 .
[8] Stelios Pavlidis,et al. Multi-membership gene regulation in pathway based microarray analysis , 2009, Algorithms for Molecular Biology.
[9] Jorge Nocedal,et al. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.
[10] Antonio Pérez-Garrido,et al. Defect-free global minima in Thomson's problem of charges on a sphere. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[11] Xiang,et al. Efficiency of generalized simulated annealing , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[12] Jasjeet S. Sekhon,et al. Genetic Optimization Using Derivatives , 2011, Political Analysis.
[13] Marcelo A. Moret,et al. Generalized simulated annealing applied to protein folding studies , 2006, J. Comput. Chem..
[14] Xin Yao,et al. Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..
[15] Jorge Nocedal,et al. A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..
[16] Ewa Figielska,et al. 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 , 2009, Comput. Ind. Eng..
[17] Maxime Caron,et al. Designing small multiple-target artificial RNAs , 2010, Nucleic acids research.
[18] J. Nash. Compact Numerical Methods for Computers , 2018 .
[19] Griff L. Bilbro,et al. Comparison of a genetic algorithm with a simulated annealing algorithm for the design of an ATM network , 2000, IEEE Communications Letters.
[20] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[21] D Cvijovicacute,et al. Taboo search: an approach to the multiple minima problem. , 1995, Science.
[22] Péter Sólymos,et al. dclone: Data Cloning in R , 2010, R J..
[23] Williams,et al. Method of constrained global optimization. , 1994, Physical review letters.
[24] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[25] C. Tsallis,et al. Generalized simulated annealing , 1995, cond-mat/9501047.
[26] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[27] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[28] X. Gong,et al. Generalized simulated annealing algorithm and its application to the Thomson model , 1997 .
[29] T. Erber,et al. Equilibrium configurations of N equal charges on a sphere , 1991 .
[30] David J. Wales,et al. Structure and dynamics of spherical crystals characterized for the Thomson problem , 2006 .
[31] David Ardia,et al. DEoptim: An R Package for Global Optimization by Differential Evolution , 2009 .
[32] Martyn Plummer,et al. The R Journal , 2012 .