A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
暂无分享,去创建一个
[1] Yann Collette. Contribution à l'évaluation et au perfectionnement des méthodes d'optimisation multiobjectif : application à l'optimisation des plans de rechargement de combustible nucléaire , 2002 .
[2] A. Kahng,et al. Best-so-far vs. where-you-are: implications for optimal finite-time annealing , 1994 .
[3] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[4] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[5] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .
[6] Jean-Marc Delosme,et al. Performance of a new annealing schedule , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..
[7] Huang,et al. AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .
[8] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[9] Yves Deville,et al. Simulated Annealing with Estimated Temperature , 2000, AI Commun..
[10] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[11] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[12] Peter Salamon,et al. Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .
[13] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[14] Juraj Hromkovic,et al. Algorithmics for Hard Problems , 2002, Texts in Theoretical Computer Science An EATCS Series.