Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results

References

• Aarts E. , Korst J. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (1989) (John Wiley & Sons, New York) Google Scholar
• Barr R. S. , Golden B. , Kelly J. P. , Resende M. G. C. , Stewart W. R. Designing and reporting on computational experiments with heuristic methods. J. Heuristics (1996) 1 9 32 Crossref, Google Scholar
• Bondy J. A. , Murty U. S. R. Graph Theory with Applications (1976) (Elsevier Science Publishing Co., Inc., North-Holland, New York) Crossref, Google Scholar
• Fleischer M. Assessing the performance of the simulated annealing algorithm using information theory. (1993) . Doctoral dissertation, Case Western Reserve University, Cleveland, OH Google Scholar
• Fleischer M. , Jacobson S. H. Assessing the finite-time performance of the simulated annealing algorithm using information theory. (1998) . Technical report, Old Dominion University, Norfolk, VA Google Scholar
• Fleischer M. Cybernetic optimization by simulated annealing: Solving continuous variable problems. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (1998) (Kluwer Academic Publishers, Norwell, MA) 403 418 . Ch. 28 Google Scholar
• Garey M. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman and Co., New York) Google Scholar
• Goldie C. , Pinch R. Communication Theory (1991) (Cambridge University Press, New York) Crossref, Google Scholar
• Goldstein L. , Waterman M. Neighborhood size in the simulated annealing algorithm. Amer. J. Math. Management Sci. (1988) 8 409 423 Google Scholar
• Hooker J. N. Needed: An empirical science of algorithms. Oper. Res. (1993) 42 201 212 Link, Google Scholar
• Hooker J. N. Testing heuristics: We have it all wrong. J. Heuristics (1995) 1 33 42 Crossref, Google Scholar
• Hooker J. N. (1993) . Correspondence Google Scholar
• Johnson D. S. , Aragon C. R. , McGeoch L. A. , Schevon C. Optimization by simulated annealing: An experimental evaluation, part I (graph partitioning). Oper. Res. (1989) 37 865 892 Link, Google Scholar
• Khinchin A. I. Mathematical Foundations of Information Theory (1957) (Dover Publications, Inc., New York) Google Scholar
• L'Ecuyer P. Simulation of algorithms for performance analysis. INFORMS J. Comput. (1996) 8 16 20 Link, Google Scholar
• Manber U. Introduction to Algorithms: A Creative Approach (1989) (Addison-Wesley Publishing Company, New York) Google Scholar
• McGeoch C. C. Toward an experimental method for algorithm simulation. INFORMS J. Comput. (1996) 8 1 15 Link, Google Scholar
• McGeoch C. C. Challenges in algorithm simulation. INFORMS J. Comput. (1996) 8 27 28 Link, Google Scholar
• Mitra D. F. , Romeo F. , Sangiovanni-Vincentelli A. Convergence and finite-time behavior of simulated annealing. Adv. Appl. Probab. (1986) 18 747 771 Crossref, Google Scholar
• Orlin J. B. On experimental methods for algorithm simulation. INFORMS J. Comput. (1996) 8 21 23 Link, Google Scholar
• Otten R. H. J. M. , van Ginneken L. P. P. P. The Annealing Algorithm (1989) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Pierce J. R. An Introduction to Information Theory: Symbols, Signals and Noise (1980) 2nd ed. (Dover Publications, Inc., New York) Google Scholar
• Shier D. F. On algorithm analysis. INFORMS J. Comput. (1996) 8 24 26 Link, Google Scholar