An annealing framework with learning memory

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 28, Issue 5, 1998, Pages 648-661

  Lo, Chun Chi ^a   Hsu, Ching Chi ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Combinatorial optimization; Distribution scheme; Mean field annealing; Simulated annealing

Indexed keywords

COMBINATORIAL MATHEMATICS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY;

LEARNING MEMORY; MEAN-FIELD ANNEALING;

SIMULATED ANNEALING;

EID: 0032165302     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.709611     Document Type: Article

References (23)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines. New York: Wiley, 1989.
2. E. Aarts and P. Laarhoven, "A pedestrian review of the theory and application of the simulated annealing algorithm," in Heidelberg Colloquium on Glassy Dynamics. Berlin, Germany: Springer-Verlag, 1986, pp. 288-306.
3. K. H. Fischer and J. A. Hertz, Spin Glasses. Cambridge, U.K.: Cambridge Univ. Press, 1991.
4. I. Kanter, "Potts-glass models of neural networks," Phys. Rev. A, vol. 37, no. 7, pp. 2739-2742, 1988.
5. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
6. F. T. Lin, C. Y. Kao, and C. C. Hsu, "Applying the genetic approach to simulated annealing in solving some np-hard problems," IEEE Trans. Syst., Man, Cybern., vol. 23, Nov./Dec. 1993.
7. S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., p. 21, 1973.
8. N. D. Mackenzie and A. P. Young, "Lake of ergodicity in the infinite-range Ising spin-glass," Phys. Rev. Lett., vol. 49, no. 5, pp. 301-304, 1982.
9. R. H. J. M. Otten and L. P. P. P. van Ginneken, The Annealing Algorithm. Norwell, MA: Kluwer, 1989.
10. M. Padberg and G. Rinaldi, "Optimization of a 532-city symmetric traveling salesman problem by branch and cut," Oper. Res. Lett., vol. 6, no. 1, pp. 1-7, 1987.
11. R. G. Palmer, "Relaxation in complex systems," in Heidelberg Colloquium on Glassy Dynamics. Berlin, Germany: Springer-Verlag, 1986, pp. 275-286.
12. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization - Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
13. G. Parisi, Statistical Field Theory. Reading, MA: Addison-Wesley, 1988.
14. C. Peterson and J. R. Anderson, "Neural networks and np-complete optimization problems; a performance study on the graph bisection problem," Complex Syst., vol. 2, pp. 59-89, 1988.
15. C. Peterson and B. Söderberg, "A new method for mapping optimization problems onto neural networks," Int. J. Neural Syst., vol. 1, no. 1, pp. 3-22, 1989.
16. S. Rees and R. Ball, "Criteria for an optimum simulated annealing schedule for problems of the traveling salesman type," J. Phys. A, vol. 20, pp. 1239-1249, 1987.
17. M. F. Shlesinger and J. T. Blendler, "The Arrhenius law versus the Vogel law," in Correlations and Connectivity, H. E. Stanley and N. Ostrowsky, Eds. Norwell, MA: Kluwer, 1990, pp. 161-166.
18. S. A. Solla, G. B. Sorkin, and S. R. White, "Configuration space analysis for optimization problems," in Disordered Systems and Biological Organization. Berlin, Germany: Springer-Verlag, 1986, pp. 283-293.
19. J. Souletie and J. L. Tholence, "Critical slowing down in spin glasses and other glasses: Fulcher versus power law," Phys. Rev. B, vol. 32, no. 1, pp. 516-519, 1985.
20. D. L. Stein, "Spin glasses," Sci. Amer., pp. 52-59, 1989.
21. M. Toda, R. Kubo, and N. Saito, Statistical Physics I. Berlin, Germany: Springer-Verlag, 1992.
22. G. von Laszewski, "A collection of graph partitioning algorithms," Tech. Rep., Northeast Parallel Architectures Center, Syracuse Univ., Syracuse, NY, 1993.
23. L. T. Wille, "Searching potential energy surfaces by simulated annealing," Nature, vol. 324, pp. 46-48, 1986.