Chapter 8 Theory and Practice of simulated Annealing (1121211), страница 9
Текст из файла (страница 9)
Industrial Engineeringand Chemical Research, 33, 1908–1918.Catoni, O. (1996) Metropolis, simulated annealing, and iterated energy transformationalgorithms: theory and experiments. Journal of Complexity, 12, 595–623.Cerf, R. (1998) Asymptotic convergence of genetic algorithms. Advances in AppliedProbability, 30, 521–550.Chardaire, P., Lutton, J.L.
and Sutter, A. (1995) Thermostatistical persistency: a powerful improving concept for simulated annealing algorithms. European Journal ofOperational Research, 86, 565–579.Charon, I. and Hudry, O. (1993) The noising method—a new method for combinatorialoptimization. Operations Research Letters, 14, 133–137.Charon, I.
and Hudry, O. (2001) The noising methods—a generalization of somemetaheuristics. European Journal of Operational Research, 135, 86–101.Cheh, K.M., Goldberg, J.B. and Askin, R.G. (1991) A note on the effectof neighborhood-structure in simulated annealing. Computers and OperationsResearch, 18, 537–547.Chen, S. and Luk, B.L. (1999) Adaptive simulated annealing for optimization in signalprocessing applications. Signal Processing, 79, 117–128.Chiang, T.S.
and Chow, Y.S. (1988) On the convergence rate of annealing processes.SIAM Journal on Control and Optimization, 26, 1455–1470.Chiang, T.S. and Chow, Y.Y. (1989) A limit-theorem for a class of inhomogeneousmarkov-processes. Annals of Probability, 17, 1483–1502.Chiang, T.S. and Chow, Y.Y. (1994) The asymptotic-behavior of simulated annealing processes with absorption. SIAM Journal on Control and Optimization, 32,1247–1265.Christoph, M. and Hoffmann, K.H. (1993) Scaling behavior of optimal simulated annealing schedules.
Journal of Physics A—Mathematical and General, 26,3267–3277.Chu, K.W., Deng, Y.F. and Reinitz, J. (1999) Parallel simulated annealing by mixingof states. Journal of Computational Physics, 148, 646–662.Çinlar, E. (1974) Introduction to Stochastic Processes. Prentice-Hall, EnglewoodCliffs, New Jersey.Cohn, H. and Fielding, M. (1999) Simulated annealing: searching for an optimaltemperature schedule. SIAM Journal on Optimization, 9, 779–802.Connors, D.P. and Kumar, P.R. (1989) Simulated annealing type markov-chains andtheir order balance-equations.
SIAM Journal on Control and Optimization, 27,1440–1461.314D. Henderson et al.Davis, T.E. (1991) Toward an Extrapolation of the Simulated Annealing ConvergenceTheory onto the Simple Genetic Algorithm (Doctoral Dissertation), University ofFlorida, Gainesville, Florida.Davis, T.E.
and Principe, J.C. (1991) A simulated annealing like convergence theoryfor the simple genetic algorithm. In: Fourth Conference on Genetic Algorithm, pp.174–181.Dekkers, A. and Aarts, E. (1991) Global optimization and simulated annealing.Mathematical Programming, 50, 367–393.Delport, V. (1998) Parallel simulated annealing and evolutionary selection forcombinatorial optimisation. Electronics Letters, 34, 758–759.Desai, M.P. (1999) Some results characterizing the finite time behaviour of the simulated annealing algorithm. Sadhana-Academy Proceedings in Engineering Sciences,24, 317–337.Dueck, G.
and Scheuer, T. (1990) Threshold accepting—a general-purpose optimization algorithm appearing superior to simulated annealing. Journal of ComputationalPhysics, 90, 161–175.Eglese, R.W. (1990) Simulated annealing: a tool for operational research. EuropeanJournal of Operational Research, 46, 271–281.Emden-Weinert, T.
and Proksch, M. (1999) Best practice simulated annealing for theairline crew scheduling problem. Journal of Heuristics, 5, 419–436.Fabian, V. (1997) Simulated annealing simulated. Computers and Mathematics withApplications, 33, 81–94.Faigle, U. and Kern, W. (1991) Note on the convergence of simulated annealingalgorithms. SIAM Journal on Control and Optimization, 29, 153–159.Faigle, U. and Kern, W. (1992) Some convergence results for probabilistic tabu search.ORSA Journal on Computing, 4, 32–37.Faigle, U.
and Schrader, R. (1988) On the convergence of stationary distributions insimulated annealing algorithms. Information Processing Letters, 27, 189–194.Faigle, U. and Schrader, R. (1988) Simulated annealing-—a case-study. AngewandteInformatik, 259–263.Fielding, M. (2000) Simulated annealing with an optimal fixed temperature. SIAMJournal of Optimization, 11, 289–307.Fleischer, M.A. (1995) Assessing the Performance of the Simulated Annealing Algorithm Using Information Theory (Doctoral Dissertation), Department of OperationsResearch, Case Western Reserve University, Clevelend, Ohio.Fleischer, M.A. (1995) Simulated annealing: past, present, and future. In:C. Alexopoulos, K.
Kang, W.R. Lilegdon and D. Goldsman (eds.), Proceedingsof the 1995 Winter Simulation Conference, IEEE Press, pp. 155–161.Fleischer, M.A. (1999) Generalized cybernetic optimization: solving continuous variable problems. In: S. Voss, S. Martello, C. Roucairol, H. Ibrahim, and I.H. Osman(eds.), Meta-heuristics: Advances and Trends in Local Search Paradigms forOptimization, Kluwer Academic Publishers, pp.
403–418.The Theory and Practice of Simulated Annealing315Fleischer, M.A. and Jacobson, S.H. (1996) Cybernetic optimization by simulatedannealing: an implementation of parallel processing using probabilistic feedback control. In: I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory andApplications, Kluwer Academic Publishers, pp. 249–264.Fleischer, M.A. and Jacobson, S.H. (1999) Information theory and the finite-timebehavior of the simulated annealing algorithm: experimental results. INFORMSJournal on Computing, 11, 35–43.Fox, B.L. (1993) Integrating and accelerating tabu search, simulated annealing, andgenetic algorithms. Annals of Operations Research, 41, 47–67.Fox, B.L.
(1994) Random restarting versus simulated annealing. Computers andMathematics with Applications, 27, 33–35.Fox, B.L. (1995) Faster simulated annealing. Siam Journal of Optimzation, 5, 485–505.Fox, B.L. and Heine, G.W. (1993) Simulated annealing with overrides, technical,Department of Mathematics, University of Colorado, Denver, Colorado.Gemen, S. and Hwang, C.R.
(1986) Diffusions for global optimization. SIAM Journalon Control and Optimization, 24, 1031–1043.Gidas, B. (1985) Nonstationary markov chains and convergence of the annealingalgorithm. Journal of Statistical Physics, 39, 73–131.Glover, F. (1989) Tabu search—Part I. ORSA Journal on Computing, 1, 190–206.Glover, F. (1994) Tabu search for nonlinear and parametric optimization (with links togenetic algorithms).
Discrete Applied Mathematics, 49, 231–255.Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic Publishers, Boston,Massachusetts.Goldstein, L. and Waterman, M. (1988) Neighborhood size in the simulated annealing algorithm. American Journal of Mathematical and Management Sciences, 8,409–423.Granville, V., Krivanek, M. and Rasson, J.P.
(1994) Simulated annealing—a proof ofconvergence. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16,652–656.Hajek, B. (1988) Cooling schedules for optimal annealing. Mathematics of OperationsResearch, 13, 311–329.Hamma, B., Viitanen, S. and Torn, A. (2000) Parallel continuous simulated annealingfor global optimization. Optimization Methods and Software, 13, 95–116.Hammersley, J.M. and Handscomb, D.C. (1964) Monte Carlo Methods, Methuen,John Wiley & Sons, London, New York.Hu, T.C., Kahing, A.B. and Tsao, C.W.A.
(1995) Old bachelor acceptance: a newclass of non-monotone threshold accepting methods. ORSA Journal on Computing,7, 417–425.Isaacson, D.L. and Madsen, R.W. (1976) Markov Chains, Theory and Applications.John Wiley & Sons, New York.Jacobson, S.H. (2002) Analyzing the performance of local search algorithms using generalized hill climbing algorithms, pp. 441–467.
(Chapter 20 in Essays and Surveys316D. Henderson et al.on Metaheuristics, P. Hansen and C.C. Ribeiro (eds.), Kluwer Academic Publishers,Norwell, Massachusetts.Jacobson, S.H., Sullivan, K.A. and Johnson, A.W. (1998) Discrete manufacturing process design optimization using computer simulation and generalized hillclimbing algorithms. Engineering Optimization, 31, 247–260.Jacobson, S.H. and Yücesan, E. (2002a) A performance measure for generalized hillclimbing algorithms. Technical Report, Department of Mechanical and IndustrialEngineering, University of Illinois, Urbana, Illinois.Jacobson, S.H.
and Yücesan, E. (2002b) On the effectiveness of generalized hillclimbing algorithms. Technical Report, Department of Mechanical and IndustrialEngineering, University of Illinois, Urbana, Illinois.Johnson, A.W. and Jacobson, S.H. (2002a) A class of convergent generalized hillclimbing algorithms.
Applied Mathematics and Computation, 125(2–3), 359–373.Johnson, A.W. and Jacobson, S.H. (2002b) On the convergence of generalized hillclimbing algorithms. Discrete Applied Mathematics (To Appear).Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C. (1989) Optimizationby simulated annealing—an experimental evaluation; part 1, graph partitioning.Operations Research, 37, 865–892.Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C. (1991) Optimizationby simulated annealing—an experimental evaluation; part 2, graph-coloring andnumber partitioning. Operations Research, 39, 378–406.Kiatsupaibul, S.
and Smith, R.L. (2000) A general purpose simulated annealing algorithm for integer linear programming. Technical Report, Department of Industrialand Operations Engineering, University of Michigan, Ann Arbor, Michigan.Kirkpatrick, S., Gelatt, Jr., C.D. and Vecchi, M.P. (1983) Optimization by simulatedannealing. Science, 220, 671–680.Koulamas, C., Antony, S.R.
and Jaen, R. (1994) A survey of simulated annealingapplications to operations-research problems. OMEGA-International Journal ofManagement Science, 22, 41–56.Leite, J.P.B. and Topping, B.H.V. (1999) Parallel simulated annealing for structuraloptimization. Computers and Structures, 73, 545–564.Liepins, G.E. and Hilliard, M.R. (1989) Genetic algorithms: foundations andapplications. Annals of Operations Research, 21, 31–58.Lin, C.K.Y., Haley, K.B. and Sparks, C.
(1995) A comparative study of both standardand adaptive versions of threshold accepting and simulated annealing algorithmsin three scheduling problems. European Journal of Operational Research, 83,330–346.Locatelli, M. (1996) Convergence properties of simulated annealing for continuousglobal optimization. Journal of Applied Probability, 33, 1127–1140.Locatelli, M.
(2000) Simulated annealing algorithms for continuous global optimization: convergence conditions. Journal of Optimization Theory and Applications,104, 121–133.Lundy, M. and Mees, A. (1986) Convergence of an annealing algorithm. MathematicalProgramming, 34, 111–124.The Theory and Practice of Simulated Annealing317Ma, J. and Straub, J.E. (1994) Simulated annealing using the classical densitydistribution.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
