Simulated annealing

Match

Volumn 34, Issue , 1996, Pages 7-49

  Kvasnička, Vladimír ^a   Pospíchal, Jiří ^a  

^a SLOVAK UNIVERSITY OF TECHNOLOGY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039607975     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. J. H. Holland, Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975).
2. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA. (1989)
3. Z. Michalewicz, Genetic Algorithm + Data Structure = Evolution Programs. Springer Verlag, Berlin (1992).
4. H. P. Schwefel, Numerical Optimization for Computer Models. Wiley, Chichester (1981).
5. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing. Theory and Applications. Reidel, Dordrecht (1987).
6. R. H. J. M. Otten and L. P. P. P. van Ginneken, Annealing Algorithm. Kluwer, Boston (1989).
7. S. Kirkpatrick, C. D. Gelatt Jr. and M. P. Vecchi, Optimization by Simulated Annealing. Science 220, 671-680 (1983).
8. J. Cerny, Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm. J. Opt. Theory Appl. 45, 41-51 (1985).
9. N. Metropolis, A. W. Rosenbluth, N. N. Rosenbluth, A. H. Teller and E. Teller, Equation of State Calculations for Fast Computing Machines. J. Chem. Phys. 21, 1087-1092 (1953).
10. M. Toda, R. Kubo, and N. Saito, Statistical Physics. Springer Verlag, Berlin (1983).
11. K. Deb, D. E. Goldberg, Sufficient Conditions for Deceptive and Easy Binary Functions. (IlliGAL Report No. 91008), Urbana: University of Illinois at Urbana Champaign, Illinois Genetic Algorithm Laboratory.
12. J. Pospichal and V. Kvasnicka, Fast Evaluation of Chemical Distance by Simulated-Annealing Algorithm. J. Chem. Inf. Comp. Sci. 33, 879-884 (1993).
13. V. Kvasnicka, J. Pospichal and D. Hesek, Augmented Simulated Annealing Algorithm for the TSP. Central European Journal for Operations Research and Economics 2, 307-317 (1993).
14. S. W. Mahfoud, D. E. Goldberg, A genetic algorithm for parallel simulated annealing, in Parallel Problem Solving from Nature, 2, ed. by R. Manner, B. Manderick, pp. 301-310, North-Holland, Amsterdam (1992).
15. K. A. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD Thesis, University of Michigan (1975).
16. M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completness. Freeman and Co., San Francisco (1979).
17. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by Simulated Annealing: an Experimental Evaluation, List of Abstracts, Workshop on Statistical Physics in Engineering and Biology, Yorktown Heights, April 1984, revised version, 1986.
18. M. E. Snow, Powerful Simulated Annealing Algorithm Locates Global Minimum of Protein-Folding Potentials From Multiple Starting Conformations. J. Comput. Chem. 13, 579-584 (1992).
19. J. M. Sutler, S. L. Dixon, P. C. Jurs, Automated Descriptor Selection for Quantitative Structure-Activity Relationships Using Generalized Simulated Annealing J. Chem. Inf. Comput. Sci. 35, 77-84 (1995).
20. J. H. Kalivas, ed., Adaption of Simulated Annealing to Chemical Optimization Problems. Elsevier, Amsterdam (1995).
21. V. Kvasnicka, J. Pospichal, Canonical Indexing and Constructive Enumeration of Molecular Graphs. J. Chem. Inf. Comp. Sci. 30, 99-105 (1990).
22. M. I. Skvortsova, I. I. Baskin, O.L. Slovokhotova, V. A. Palulin, N. S. Zefirov, Inverse Problem in QSAR/QSPR Studies for the Case of Topological Indices Characterizing Molecular Shape (Kier Indices). J. Chem. Inf. Comput. Sci. 33, 630-634 (1993).
23. V. Venkatasubramanian, K. Chan, J. M. Caruthers, Evolutionary design of Molecules with Desired Properties Using the Genetic Algorithm. J. Chem. Inf. Comp. Sci. 35, 188-195 (1995).
24. R. P. Sheridan, S. K. Kearsley, Using a Genetic Algorithm To Suggest Combinatorial Libraries. J. Chem. Inf. Comput. Sci. 35, 310-320 (1995).
25. V. Kvasnicka, J. Pospichal, Simulated Annealing Construction of Molecular Graphs with Required Properties, J. Chem. Inf. Comp. Sci. 36, 516-526 (1996).
26. J.-L. Fulton, Stochastic Generator of Chemical Structure. 2. Using Simulated Annealing to Search the Space of Constitutional Isomers. J. Chem. Inf. Comput. Sci. 36, 731-740 (1996).
27. M. Randic, On Characterization of Molecular Branching. J. Am. Chem. Soc. 97, 6609-6615 (1975).
28. H. Wiener, Structural Determination of Paraffin Boiling Points. J. Am. Chem. Soc. 69, 17-20 (1947).
29. D. E. Goldberg, B. Korb, and K. Deb, Messy Genetic Algorithms: Motivation, Analysis and First Results. Complex Systems 3, 493-530 (1989).
30. D. E. Goldberg, K. Deb, and B. Korb, Messy Genetic Algorithms: Studies in Mixed Size and Scale. Complex Systems 5, 415-444 (1990)
31. K. Deb, Binary and Floating-Point Function Optimization Using Messy Genetic Algorithm. PhD Thesis, Department of General Engineering, University of Illinois at Urbana-Champaign (1991).
32. V. Kvasnicka and J Pospichal, Messy Simulated Annealing, Journal of Chemometrics 9, 309-322 (1995).