Chapter 8 Theory and Practice of simulated Annealing (1121211), страница 10

Просмтор этого файла доступен только зарегистрированным пользователям. Но у нас супер быстрая регистрация: достаточно только электронной почты!

Текст из файла (страница 10)

Journal of Chemical Physics, 101, 533–541.Mazza, C. (1992) Parallel simulated annealing. Random Structures and Algorithms,3, 139–148.Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E. (1953)Equation of state calculations by fast computing machines. Journal of ChemicalPhysics, 21, 1087–1092.Meyer, C.D.

(1980) The condition of a finite markov chain and perturbation boundsfor the limiting probabilities. SIAM Journal of Algebraic and Discrete Methods, 1,273–283.Mitra, D., Romeo, F. and Sangiovanni-Vincentelli, A.L. (1986) Convergence andfinite time behavior of simulated annealing. Advances in Applied Probability, 18,747–771.Moscato, P. (1993) An introduction to population approaches for optimization andhierarchical objective functions: a discussion on the role of tabu search.

Annals ofOperations Research, 41, 85–121.Moscato, P. and Fontanari, J.F. (1990) Convergence and finite-time behavior ofsimulated annealing. Advances in Applied Probability, 18, 747–771.Muhlenbein, H. (1997) Genetic algorithms. In: E, Aarts and J.K. Lenstra (eds.), LocalSearch in Combinatorial Optimization. John Wiley & Sons, New York, New York,pp. 137–172.Nissen, V. and Paul, H. (1995) A modification of threshold accepting and its applicationto the quadratic assignment problem. OR Spektrum, 17, 205–210.Nourani, Y. and Andresen, B. (1998) A comparison of simulated annealing coolingstrategies.

Journal of Physics A—Mathematical and General, 31, 8373–8385.Ogbu, F.A. and Smith, D.K. (1990) The application of the simulated annealingalgorithm to the solution of the N/M/Cmax flowshop problem. Computers andOperations Research, 17, 243–253.Ohlmann, J.W. and Bean, J.C. (2000) Compressed annealing: simulated annealing under pressure. Technical Report, Department of Industrial and OperationsEngineering, University of Michigan, Ann Arbor, Michigan.Orosz, J.E.

and Jacobson, S.H. (2002a) Finite-time performance analysis of staticsimulated annealing algorithms. Computational Optimization and Applications, 21,21–53.Orosz, J.E. and Jacobson, S.H. (2002b) Analysis of static simulated annealingalgorithms. Journal of Optimization Theory and Application (to appear).Pepper, J.W., Golden, B.L. and Wasil, E.A. (2000) Solving the traveling salesmanproblem with demon algorithms and variants. Technical Report, Smith School ofBusiness, University of Maryland, College Park, Maryland.Romeijn, H.E., Zabinsky, Z.B., Graesser, D.L.

and Noegi, S. (1999) New reflectiongenerator for simulated annealing in mixed-integer/continuous global optimization.Journal of Optimization Theory and Applications, 101, 403–427.Romeo, F. and Sangiovanni-Vincentelli, A. (1991) A theoretical framework forsimulated annealing.

Algorithmica, 6, 302–345.318 D. Henderson et al.Rosenthal, J.S. (1995) Convergence rates for markov chains. SIAM Review, 37,387–405.Ross, S.M. (1996) Stochastic Processes. John Wiley & Sons, New York, New York.Ross, S.M. (1997) Introduction to Probability Models. Academic Press, San Diego,California.Rossier, Y., Troyon, M. and Liebling, T.M.

(1986) Probabilistic exchange algorithmsand euclidean traveling salesman problems. OR Spektrum, 8, 151–164.Rudolph, G. (1994) Convergence analysis of cononical genetic algorithms. IEEETransactions on Neural Networks, Special Issue on Evolutional Computing, 5,96–101.Scheermesser, T. and Bryngdahl, O. (1995) Threshold accepting for constrained halftoning. Optics Communications, 115, 13–18.Schuur, PC. (1997) Classification of acceptance criteria for the simulated annealingalgorithm.

Mathematics of Operations Research, 22, 266–275.Seneta, E. (1981) Non-Negative Matrices and Markov Chains. Springer-Verlag, NewYork, New York.Siarry, P., Berthiau, G., Durbin, F. and Haussy, J. (1997) Enhanced simulated annealingfor globally minimizing functions of many-continuous variables. ACM TransactionsOn Mathematical Software, 23, 209–228.Solla, S.A., Sorkin, G.B. and White, S.R. (1986) Configuration space analysis foroptimization problems. NATO ASI Series, Disordered Systems and BiologicalOrganization, F20, 283–293.Srichander, R. (1995) Efficient schedules for simulated annealing. EngineeringOptimization, 24, 161–176.Stern, J.M. (1992) Simulated annealing with a temperature dependent penalty function.ORSA Journal on Computing, 4, 311–319.Storer, R.H., Wu, S.D.

and Vaccari, R. (1992) New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38,1495–1509.Straub, J.E., Ma, J. and Amara, P. (1995) Simulated annealing using coarse grainedclassical dynamics: smouuchowski dynamics in the gaussian density approximation.Journal of Chemical Physics, 103, 1574–1581.Strenski, P.N. and Kirkpatrick, S. (1991) Analysis of finite length annealing schedules.Algorithmica, 6, 346–366.Sullivan, K.A. and Jacobson, S.H. (2000) Ordinal hill climbing algorithms for discretemanufacturing process design optimization problems.

Discrete Event DynamicalSystems, 10, 307–324.Sullivan, K.A. and Jacobson, S.H. (2001) A convergence analysis of generalized hillclimbing algorithms. IEEE Transactions on Automatic Control, 46, 1288–1293.Tian, P., Ma, J. and Zhang, D.M. (1999) Application of the simulated annealingalgorithm to the combinatorial optimisation problem with permutation property: aninvestigation of generation mechanism. European Journal of Operational Research,118, 81–94.The Theory and Practice of Simulated Annealing 319Tovey, C.A. (1988) Simulated simulated annealing. American Journal of Mathematicaland Management Sciences, 8, 389–407.Tsitsiklis, J.N.

(1989) Markov chains with rare transitions and simulated annealing.Mathematics of Operations Research, 14, 70–90.van Laarhoven, P.J.M. (1988) Theoretical and Computational Aspects of SimulatedAnnealing, Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands.van Laarhoven, P.J.M. and Aarts, E.H.L. (1987) Simulated Annealing: Theory andApplications, D.

Reidel, Kluwer Academic Publishers, Dordrecht, Boston, Norwell,Massachusetts.Varanelli, J.M. and Cohoon, J.P. (1999) A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems.Computers and Operations Research, 26, 481–503.Yan, D. and Mukai, H. (1992) Stochastic discrete optimization. SIAM Journal onControl and Optimization, 30, 594–612.Yang, R.L. (2000) Convergence of the simulated annealing algorithm for continuous global optimization. Journal of Optimization Theory and Applications, 104,691–716.Yao, X. (1995) A new simulated annealing algorithm. International Journal ofComputer Mathematics, 56, 161–168.Yao, X. and Li, G. (1991) General simulated annealing.

Journal of Computer Scienceand Technology, 6, 329–338.Zabinsky, Z.B., Smith, R.L., McDonald, J.F., Romeijn, H.E. and Kaufman,D.E. (1993) Improving hit-and-run for global optimization. Journal of GlobalOptimization, 3, 171–192..

Характеристики

Список файлов лекций