Skip to main content
SpringerLink
Log in
Book cover

Applied Simulated Annealing pp 1–16Cite as

Introduction

  • Chapter

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 396))

Abstract

Simulated Annealing (S.A.) is a powerful stochastic search method applicable to a wide range of problems which occur in a variety of disciplines. These include mathematics (graph problems), condensed matter physics (finding the ground state of spin glasses), engineering problems (VLSI design), mathematical programming (combinatorial optimization), statistics (neural networks), operations research (heuristic approaches), etc. Obviously, these are only some selected examples. In this volume we are focusing on the application of the S.A. approach to combinatorial optimization problems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

Books

  1. Aarts, E., and Korst, J., Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, Wiley, 1989.

    Google Scholar 

  2. Lengauer, T., Combinatorial algorithms for integrated circuit layout, Wiley, 1990.

    Google Scholar 

  3. Otten, R.H.J.M., and van Ginneken, L.P.P.P., The annealing algorithm, Kluwer, 1990.

    Google Scholar 

  4. van Laarhoven, P.J.M., Theoretical and computational aspects of simulated annealing, Centre for Mathematics and Computer Science, Amsterdam,1988.

    Google Scholar 

  5. van Laarhoven, P.J.M., and Aarts, E.H.L., Simulated annealing: theory and applications, Reidel, 1987.

    Google Scholar 

  6. Weisbuch, G., Complex systems dynamics, Addison-Wesley, 1991.

    Google Scholar 

  7. Wong, D.F. et al, Simulated annealing for VLSI design, Kluwer, 1988.

    Google Scholar 

Papers

  1. Aarts, E.H.L., and Korst, J.H.M., Boltzmann machines for travelling salesman problems, EJOR 39 (1989) 79–95.

    Article  Google Scholar 

  2. Aarts, E.H.L., and Korst, J.H.M., Computations in massively parallel networks based on the Boltzmann machine: a review, Parallel Computing 9 (1989) 129–145.

    Article  Google Scholar 

  3. Aarts, E.H.L., and van Laarhoven, P.J.M., Simulated annealing: an introduction, Statistica Neerlandica 43 (1989) 31–52.

    Article  Google Scholar 

  4. Aarts, E.H.L., and Korst, J.H.M., Boltzmann machines as a model for parallel annealing, Algoritmica 6 (1991) 437–465.

    Article  Google Scholar 

  5. Aarts, E.H.L. et al, Simulated annealing and circuit layout, Nieuw Arch. Wisk., Vierde Serie 9 (1991) 13–39.

    Google Scholar 

  6. Abramson,D., Constructing school timetables using simulated annealing: sequential and parallel algorithms,Mang. Sci. 37 (1991) 98–113.

    Google Scholar 

  7. Akman, V., Implementation of Karp-Luby Monte-Carlo method-an exercise in approximate counting, Comp. Journ. 34 (1991) 279–282.

    Google Scholar 

  8. Allwright, J.R.A., and Carpenter, D.B., Distributed implementation of simulated annealing for the travelling salesman problem, Parallel Computing 10 (1989) 335–338.

    Article  Google Scholar 

  9. Althofer, I. and Koschnick, K.U., On the convergence of threshold accepting, App. Math. and Optim. 24 (1991) 183–195.

    Article  Google Scholar 

  10. Anagnostou, G. et al, A computational procedure for part design, Comp. Meth. in Appi. Mech. and Eng. 97 (1992) 33–48.

    Article  Google Scholar 

  11. Apolloni, B. et al, Quantum stochastic optimization, Stochas. Process. and their Appli. 33 (1989) 233–244.

    Article  Google Scholar 

  12. Arable, P. and Hubert, L.J., Combinatorial data-analysis, Annual Review of Psych. 43 (1992) 169–203.

    Article  Google Scholar 

  13. Ashby, M.F., Psysical modeling of materials problems, Materials Sci. and Tech-no. 8 (1992) 102–111.

    Article  Google Scholar 

  14. Banzhaf, W., A new dynamical-approach to the traveling salesman problem, Psysics Letters A 136 (1989) 45–51.

    Article  Google Scholar 

  15. Barbosa, V.C. and Gafni, E., A distributed implementation of simulated annealing, J. of Parall. and Distr. Comput. 6 (1989) 411–434.

    Article  Google Scholar 

  16. Barbosa, V.C. and Gafni, E., Concurrency in heavily loaded neighborhood-constrained systems, ACM Trans. on Progr. Langua. and Syst. 11 (1989) 562–584.

    Google Scholar 

  17. Barbinok, A.1., Problems of combinatorial optimization, statistical sums and representations of the full linear group, Math. Notes 49 (1991) 3–9.

    Article  Google Scholar 

  18. Bifbro, G.L. and Snyder, W.E., Optimization of functions with many minima, IEEE Trans. on Syst., Man, and Cybern. 21 (1991) 840–849.

    Google Scholar 

  19. Bowler, K.C., Transputer machines and applications, Physics Reports- Review Section of Physics Letters 207 (1991) 261–289.

    Google Scholar 

  20. Brooks, D.G. and Verdini, W.A., Computational experience with generalized simulated annealing over continuous variables, Ameri. J. of Mathematical and Mang. Scie. 8 (1988) 425–449.

    Google Scholar 

  21. Brunger, A.T., Crystallographic refinement by simulated annealing on supercomputers, Cray Channels 10 (1988) 16–19.

    Google Scholar 

  22. Burgess, N. and Moore, M.A., Cost distributions in large combinatorial optimization problems, J. of Phys. A-Mathe. and General 22 (1989) 4599–4609.

    Article  Google Scholar 

  23. Catoni, O., Sharp large deviations estimates for simulated annealing algorithms, Annales de l’Inst. H. Poincare. Probab. is Statistique 27 (1991) 291–383.

    Google Scholar 

  24. Cerny, V., Methods of statistical physics and complex mathematical problems, Europ. J. of Physics 9 (1988) 94–100.

    Google Scholar 

  25. Chang-Sung, J. and Myung-Ho, K., Fast parallel computing simulated annealing for traveling salesman problem on SiMD machines with linear interconnections, Parallel Computing 17 (1991) 221–228.

    Article  Google Scholar 

  26. Cheh, K.M. et al, A note on the effect of neighborhood-structure in simulated annealing, Comp. and Operat. Resea. 18 (1991) 537–547.

    Google Scholar 

  27. Chen, C. T. et al, Medical image segmentation by a constraint satisfaction neural network, IEEE Tres. on Nucl. Scie. 38 (1991) 678–686.

    Article  Google Scholar 

  28. Chen,G.S. et al, Optimal placement of active/passive members in truss structures using simulated annealing, AIAA Journal 29 (1991) 1327–1334.

    Article  Google Scholar 

  29. Chen, J. et al, A system control framework for the self-fertilization and selection process of breeding, Biosystems 24 (1991) 291–299.

    Article  Google Scholar 

  30. Chiang, H.-D. and Jean-Jumeau, R., Optimal network reconfigurations in distribution systems.11. Solution algorithms and numerical results, IEEE Trans. on Power Delivery 5 (1990) 1568–1574.

    Article  Google Scholar 

  31. Chiang, H.-D. et al, Optimal capacitor placements in distribution systems.L. A new formulation and the overall problem, IEEE Trans. on Power Delivery 5 (1990) 634–642.

    Article  Google Scholar 

  32. Chiang, T.S. and Chow,Y.Y.,A limit-theorem for a class of inhomogeneous Markov-processes, Annals of Probab. 17 (1989) 1483–1502.

    Article  Google Scholar 

  33. Ciric, A.R. and Floudas, C.A., Heat exchanger network synthesis without decomposition, Comput. and Chem. Eng. 15 (1991) 385–396.

    Google Scholar 

  34. Cole, J.B., The statistical mechanics of image recovery and pattern recognition, American J. of Physics 59 (1991) 839–842.

    Article  Google Scholar 

  35. Collins, N.E. et al, Simulated annealing-an annotated bibliography, Amercan J. of Mathem. and Manag. Scien. 8 (1988) 209–307.

    Google Scholar 

  36. Connolly, D.T., An improved annealing sheme for the OAP, EJOR 46 (1990)93–100.

    Google Scholar 

  37. Connolly, D.T., General-purpose simulated annealing, J. of the Operatio. Resea. Society 43 (1992) 495–505.

    Google Scholar 

  38. Decker, K.M., The Monte- Carlo method in science and engineering theory and application, Comp. Meth in Appi. Mech. and Eng. 89 (1991) 463–483.

    Google Scholar 

  39. Deckers, A. and Aarts, E., Global optimization and simulated annealing, Mathe. Programming 30 (1991) 367–393.

    Article  Google Scholar 

  40. Dodd, N., Graph matching by stochastic optimization applied to the implementation of multi layer perceptrons on transputer networks, Parallel Computing 10 (1989) 135–142.

    Article  Google Scholar 

  41. Dodd, N., Slow annealing versus multiple fast annealing runs-an empirical investigation, Parallel Computing 16 (1990) 269–272.

    Article  Google Scholar 

  42. Dolan,W.B. et al, Algorithmic efficiency of simulated annealing for heat exchanger network design, Comp.and Chem. Eng. 14 (1990) 1039–1050.

    Article  Google Scholar 

  43. Dougherty, D.E., and Marryott, R.A., Optimal groundwater-management.1. Simulated annealing, Water Resour. Resear. 27 (1991) 2493–2508.

    Google Scholar 

  44. Dowsland, K, A., Hill-climbing, simulated annealing and the Steiner problem in graphs, Eng. Opt. 17 (1991) 91–107.

    Article  Google Scholar 

  45. Drexl, A., A simulated annealing approach to the multiconstraint zero-one knapsack problem, Computing 40 (1988) 1–8.

    Article  Google Scholar 

  46. Dzemyda, G. et al, Simulated annealing for parameter. grouping, Informatica 1 (1990) 20–39.

    Google Scholar 

  47. Eglese,R.W., Simulated annealing: a tool for operational research, EJOR 46 (1990) 271–281.

    Article  Google Scholar 

  48. Elperin, T. et al, Machine design optimization by the Monte Carlo annealing method, Eng. Opt. 15 (1990) 193–203.

    Article  Google Scholar 

  49. Elperin, T., Monte Carlo structural optimization in discrete variables with annealing algorith, Int. J. Numerical Meth. in Eng. 26 (1988) 815–821.

    Article  Google Scholar 

  50. Engel, J., Teaching feed-forward neural networks by simulated annealing, Complex Systems 6 (1988) 641–648.

    Google Scholar 

  51. Faigle, U., and Schrader, R., On the convergence of stationary distributions in simulated annealing algorithms, Infm. Process. Letters 27 (1988) 189–194.

    Article  Google Scholar 

  52. Faigle, U., and Schrader, R., Simulated annealing-a case study, Angewandte Informatik 30 (1988) 259–263.

    Google Scholar 

  53. Faigle,U., and Kern, W., On weak reversability and steady state distributions in simulated annealing, Meth. of Oper. Resea. 62 (1990) 205–209.

    Google Scholar 

  54. Faigle, U. and Kern,W., Note on the convergence of simulated annealing algorithms, SIAM J. on Control and Optm. 29 (1991) 153–159.

    Article  Google Scholar 

  55. Ferscha, A., and Haring, G., Asynchronous parallel Boltzmann machines for combinatorial optimization: parallel simulation and convergence, Meth. of Opera. Research 64 (1991) 545–555.

    Google Scholar 

  56. Fetterolf, P.C. and Anandalingam, G., Optimal design of LAN-WAN inter networks: an approach using simulated annealing, Annals of Operat. Research 36 (1992) 275–298.

    Google Scholar 

  57. Floudas, C.A., and Visweswaran, V., A global optimization algoritm (GOP) for certain classes of nonconvex NLPS.1.Theory, Comp.and Chem. Eng. 12 (1990) 1397–1417.

    Article  Google Scholar 

  58. Gelfand, S.B., and Mitter, S.K., Simulated annealing type algorithms for multivariate optimization, Algorithmica (NY) 6 (1991) 419–436.

    Article  Google Scholar 

  59. Gelfand, S.B., and Mitter, S.K., Simulated annealing with noisy or imprecise energy measurements, J. of Opt. Theory and Applica. 62 (1989) 49–62.

    Article  Google Scholar 

  60. Giuma,T. and Walker, P., PSpice circuit generation through the method of simulated annealing, IEEE Trans. on Education 35 (1992) 159–163.

    Article  Google Scholar 

  61. Glover, F., and Greenberg, H.J., New approaches for heuristic search: a bilateral linkage with artificial intelligence,EJOR 39 (1989) 119–130.

    Google Scholar 

  62. Grassberger,P., and Freund,H., An efficient heuristic algorithm for minimum matching, Zeitschrift fur Opera. Resear. 34 (1990) 239–253.

    Google Scholar 

  63. Gunel, T., A new synthesis approach to the nonuniform transmission line impedance matching sections, Modell., Simu. and Control A 37 (1991) 25–29.

    Google Scholar 

  64. Guo, H. et al, A fast algorithm for simulated annealing, Physica Scripta Volume T 38 (1991) 40–44.

    Article  Google Scholar 

  65. Hajek, B., and Sasaki, G., Simulated annealing-to cool or not, Systems and Control Letters 12 (1989) 443–447.

    Article  Google Scholar 

  66. Harhalakis, G. et al, Manufacturing cell design using simulated annealing: an industrial application, J. of Intell. Manuf, 1 (1990) 185–191.

    Article  Google Scholar 

  67. Hasselfield, C.W. et al, An automated method for least cost distribution planning, IEEE Trans. on Power Delivery 5 (1990) 1188–1194.

    Article  Google Scholar 

  68. Heragu,S.S., and Alfa, A.S., Experimental analysis of simulated annealing based algorithms for the layout problem, EJOR 57 (1992) 190–202.

    Article  Google Scholar 

  69. Hoede, C., Crystallization: a new type of heuristics for the traveling salesman problem and other combinatorial optimization problems, Ars Combinatoria 25B (1988) 115–131.

    Google Scholar 

  70. Hong, G. et al, A fast algorithm for simulated annealing, Psysica Scripta 38 (1991) 40–44.

    Google Scholar 

  71. Hwang, F.K., and Richards, D.S., Steiner tree problems, Netw, 22 (1992) 55–59.

    Article  Google Scholar 

  72. lkuo, M., Optimal simulated-annealing method based on stochastic-dynamic programming, Psysical Review A (Gen, Phys.) 39 (1989) 2635–2642.

    Google Scholar 

  73. loannidis, Y.E., and Younkyung,C.K., Randomized algorithms for optimizing large join queries, SIGMOD Record 19 (1990) 312–321.

    Article  Google Scholar 

  74. Jajodia, S. et al, CLASS: computerized LAyout solutions using Simulated Annealing, Int. J of Prod. Resea. 30 (1992) 95–108.

    Article  Google Scholar 

  75. Joliet, P.M., Simulated annealing for a constrained allocation problem,Mathematics and Comp. in Simula. 32 (1990) 149–154.

    Google Scholar 

  76. Jeong, C.-S., and Kim, M.-H., Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections, Parallel computing 17 (1991) 221–228.

    Article  Google Scholar 

  77. Jerrum, M. and Sinclair, A.,Approximating the permanent, SIAM J. on Computing 18 (1989) 1149–1178.

    Article  Google Scholar 

  78. Johnson, D.S. et al, Optimization by simulated annealing: an experimental evatuation.L. Graph partitionning, Operat. Resea. 37 (1989) 865–892.

    Google Scholar 

  79. Johnson, D.S. et al, Optimization by simulated annealing: an experimental evaluation.2. Graph-coloring and number partitioning, Ope. Res.39 (1991)378–406.

    Google Scholar 

  80. Jun, W., and Vira, C.K., Neurally-inspired stochastic algorithm for determining multistage muitiattribute sampling inspection plans, J. of Intelligent Manufacturing 2 (1991) 327–336.

    Article  Google Scholar 

  81. Kesidis, G., and Wong, E., Optimal acceptance probability for simulated annealing, Stochastics and Stocha. Reports 29 (1990) 221–226.

    Google Scholar 

  82. Kim,Y., and Kim, M., Stepwise-overlapped parallel simulated annealing algorithm, Integration, the VLSI J. 10 (1990) 39–54.

    Article  Google Scholar 

  83. Kim, Y.T. et al, Stepwise-overlapped parallel annealing and its application to floorplan designs, Computer-Aided Design 23 (1991) 133–144.

    Article  Google Scholar 

  84. Korst,J.H.M., and Aarts,E.H.L., Combinatorial optimization on a Boltzmann machine, J. of Parallel and Distributed Computing 6 (1989) 331–357.

    Article  Google Scholar 

  85. Kouvelis, P.K. et at, Simulated annealing for machine layout problems in the presence of zoning constraints,EJOR 57 (1992) 203–223.

    Google Scholar 

  86. Koulevis, P. and Chiang, W.C., A simulated annealing procedure for single row layout problems in flexible manufacturing systems, int. J. of Prod. Research 30 (1992) 717–732.

    Article  Google Scholar 

  87. Kropaczek, D.J., and Turinsky, P.J., In-core nuclear fuel management optimization for a PWR utilizing simulated annealing, Trans. of the American Nuclear Society 61 (1990) 74–76.

    Google Scholar 

  88. Krusius, J.P., Packaging architecture considerations of high density multi-chip electronic packages via system optimization, Trans. of the ASME. J. of Electronic Packaging 112 (1990) 267–271.

    Article  Google Scholar 

  89. Ku, H., and Karimi, L, Evaluation of simulated annealing for batch process scheduling, Indus. and Eng. Chemistry Research 30 (1991) 163–169.

    Article  Google Scholar 

  90. Kuik, R., and Salomon, M., Multi-level lot-sizing problem: evaluation of a simulated-annealing heuristic, EJOR 45 (1990) 25–37.

    Article  Google Scholar 

  91. Kumar, P.R., Simulated annealing and balance of recurrence orders, Proceed. of the SPIE- The Intern. Socie. for Optical Eng. 1058 (1989) 103–106.

    Google Scholar 

  92. Kämpke, T., Simulated annealing: useof a new tool in bin packing, Annals of Oper. Resea. 18 (1988) 327–332.

    Google Scholar 

  93. Lahaije,P., and Wester, R., Efficient road-map management for a CAR navigation system, Philips J. of Research 43 (1988) 477–491.

    Google Scholar 

  94. Lee, S., and Wang, H.P., Modified simulated annealing for multiple-objective engineering design optimization, J. of Intelligent Manufactur. 3 (1992) 101–108.

    Article  Google Scholar 

  95. Looi, C.K., Neural network methods in combinatorial optimization, Computers and Oper. Research 19 (1992) 191–208.

    Google Scholar 

  96. Lirov, Y., Knowledge based approach to the cutting stock problem, Mathematical and Computer Modelling 16 (1992) 107–125.

    Article  Google Scholar 

  97. Lutfiyya, H. et al, Composite stock cutting through simulated annealing, Mathematical and Comp. Modelling 16 (1992) 57–74.

    Google Scholar 

  98. Mandava, V.R., Adaptive search space scaling in digital image registration, IEEE Trans. on Medical Imaging 8 (1989) 251–262.

    Article  Google Scholar 

  99. Mc Laughlin, M.P., Simulated annealing, Dr, Dobb’s J. of Software Tools 14 (1989) 26–37.

    Google Scholar 

  100. Meyer, R.K., and Nachtsheim, C.J., Constructing exact D-optimal experimental designs by annealing, Arne. J. of Math. and Mang. Sci. 8 (1988) 329–359.

    Google Scholar 

  101. Moon, G., and Mcroberts, K.L., Combinatorial optimization in facility layout, Computers and Industrial Eng. 17 (1989) 43–48.

    Article  Google Scholar 

  102. Moscato, P., and Fontanari, J.F., Stochastic versus deterministic update in simulated annealing, Physics Letters A 146 (1990) 204–208.

    Article  Google Scholar 

  103. Nu!ton, J.D. and Salamon, P., Statistical mechanics of combinatorial optimization, Physical Review A (Gen. Physics) 37 (1988) 1351–1356.

    Google Scholar 

  104. Ogbu, F.A., and Smith, D.K., The application of the simulated annealing alga rith to the solution of the n/m/ Cmax flowshop problem, Computers and Opera. Research 17 (1990) 243–253.

    Google Scholar 

  105. Ogbu, F.A., and Smith, D.K., Simulated annealing for the permutation flowshop problem, Omega 19 (1991) 64–67.

    Article  Google Scholar 

  106. Osman, i.H., and Potts, C.N., Simulated annealing for permutation flowshop scheduling, Omega 17 (1989) 551–557.

    Article  Google Scholar 

  107. Pannetier, J., Simulated annealing-an introductory review, Institute of Physics Conference Series 107 (1990) 23–44.

    Google Scholar 

  108. Parks, G.T., Optimization of advanced gas-cooled reactor fuel performance, Nuclear Engineer 29 (1988) 167–170.

    Google Scholar 

  109. Parks, G.T., An intelligent stochastic optimization routine for nuclear fuel cycle desing, Nuclear Technology 89 (1990) 233–246.

    Google Scholar 

  110. Price, W.L., and Woodhams, F.W., Combinatorial optimization algorithms for a CAD workstation, Discrete Appl. Mathem. 26 (1990) 219–233.

    Google Scholar 

  111. Price, C.C., and Salama, M.A., Scheduling of precedence-constrained tasks on multiprocessors, Computer J. 33 (1990) 219. 229.

    Google Scholar 

  112. Raittinen, H., and Kaski, K., Image deconvolution with simulated annealing method, Psysica Scripts Vol.T 33 (1990) 126–130.

    Article  Google Scholar 

  113. Ravikumar, C.P., and Patnaik, L.M., Performance improvement of simulated annealing algorithms, Compu. Systs. Science and Eng. 5 (1990)

    Google Scholar 

  114. Romeo, F., and Sangiovanni-Vincenteili, A., A theoretical framework for simulated annealing, Algorithmica 8 (1991) 302–345.

    Article  Google Scholar 

  115. Romero, D., and Sanchez-Flores, A., Methods for the one-dimensional space allocation problem, Comput. and Oper. Resea. 17 (1990) 465–473.

    Google Scholar 

  116. Rutenbar, R.A., Simulated annealing algorithms: an overview, IEEE Circuits and Devices Magazine 5 (1989) 19–26.

    Article  Google Scholar 

  117. Saab, Y.G., and Rao, V.B., Combinatorial optimization by stochastic evolution, IEEE Trans. on Computer-Aided Desing of Integrated Circuits and Systems 10 (1991) 525–535.

    Article  Google Scholar 

  118. Salcedo, R. et al, An improved random-search algorithm for non-linear optimization, Computers and Chem’. Eng. 14 (1990) 1111–1126.

    Google Scholar 

  119. Sasaki, G.H., and Hajek, B., Time complexity of maximum matching by simulated annealing, J. of the Assoc. for Comp. Machinery 35 (1988) 387–403.

    Article  Google Scholar 

  120. Sastry, S. and Pi, J., Estimating the minimum of partitioning and floorplanning problems, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 10 (1991) 273–282.

    Article  Google Scholar 

  121. Satoh, T., and Nara, K., Maintenance scheduling by using simulated annealing method (for power plants), IEEE Trans. on Power Sys. 6 (1991) 850–857.

    Article  Google Scholar 

  122. Savage, J.E., and Wloka, M.G., Parallelism in graph-partitioning, J. of Parallel and Distributed Computing 13 (1991) 257–272.

    Article  Google Scholar 

  123. Sawyer, J.M. et al, Integration of the FORMOSA PWR in-core fuel management optimization code into nuclear design code systems, Trans. of the American Nuclear Society 63 (1991) 416–418.

    Google Scholar 

  124. Schreuder, J., Combinatorial aspects of construction of competition dutch-professional-football-leagues, Disc. Appl. Maths. 35 (1992) 301–312.

    Google Scholar 

  125. Shragowitz, E., and Lin. R-B., Combinatorial optimization by stochastic automata, Annals of Oper. Research 22 (1990) 293–324.

    Article  Google Scholar 

  126. Shyanglin, L., and Hsu-Pin, W., Modified simulated annealing for multiple-objective engineering design optimization, J. of Intel!. Manuf. 3 (1992) 101–108.

    Article  Google Scholar 

  127. Sibani, P. et al, Monte Carlo dynamics of optimization problems: a scaling description, Physical Review A (Statist., Phsy., Plas.,Flui.And Relat. Interdisc. topics) 42 (1990) 7080–7086.

    Google Scholar 

  128. Simmkin, J., and Trowbridge, C.W., Optimization problems in eiectromagnetics, IEEE Trans. on Magnetics 27 (1991) 4016–4019.

    Article  Google Scholar 

  129. Sorkin, G.B., Efficient simulated annealing on fractal energy landscapes, Algoritmica (NY) 6 (1991) 367–418.

    Google Scholar 

  130. Steele, J.M., Probability and statistics in the service of computer-science–illustrations using the assignment problem, Communications in Statistics-Theory and Methods 19 (1990) 4315–4329.

    Article  Google Scholar 

  131. Stìllinger, F.H., and Weber, T.A., Noolinear optimization simplified by hypersurface deformation, J. of Statis. Physics 52 (1988) 1429–1445.

    Article  Google Scholar 

  132. Strenski, P.N., and Kirkpatrick, S., Analysis of finite length annealing schedules, Algorithmica (NY) 6 (1991) 346–366.

    Article  Google Scholar 

  133. Styblinski, M.A., and Tang, T.-S., Experiments in nonconvex optimization. Stochastic approximation with function smoothing and simulated annealing, Neural Networks 3 (1990) 467–483.

    Article  Google Scholar 

  134. Subbiah, S., and Harrison, S.C., A simulated annealing approach to the search problem of protein crystallography, Acta Crystallogra. A45 (1989) 337–342.

    Article  Google Scholar 

  135. Sugai, Y., and Hirata, H., Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout, Inteman. J. of Systems Sciences 22 (1991) 2471–2487.

    Article  Google Scholar 

  136. Swami, A., Optimization of large join queries: combining heuristics and combinational techniques, SIGMOD Record 18 (1989) 367–376.

    Article  Google Scholar 

  137. Tam, K.Y., Simulated annealing algorithm for allocating space to manufacturing cells, Intern. J. of Prod. Research 30 (1992) 63–87.

    Article  Google Scholar 

  138. Tong, S.S., Integration of symbolic and numerical methods for optimizing complex engineering systems, IFIP Trans. A (Comp. Sci. and Techn.) A2 (1992) 3–20.

    Google Scholar 

  139. Tovey, C.A., Simulated, simulated annealing, American J. of Mathematical and Managament Sciences 8 (1988) 389–407.

    Google Scholar 

  140. Vai, M.-K. et al, Modeling of microwave semiconductor devices using simulated annealing optimization, IEEE Trans. on Electron Devi. 36 (1989) 761–762.

    Article  Google Scholar 

  141. van Laarhoven, P.J.M. et al, New upper bounds for the football pool problem for 6,7, and 8 matches, J. of Comb.Theo.,Series A 52 (1989) 304–312.

    Article  Google Scholar 

  142. van Laarhoven, P.J.M. et al, Job shop scheduling by simulated annealing, Operations Research 40 (1992) 113–125.

    Article  Google Scholar 

  143. Venkataraman, G., and Athithan, G., Spin-glass, the traveling salesman problem, neural networks and all that, Pranama J. of Phys. 36 (1991) 1–77.

    Article  Google Scholar 

  144. Witte, E.E. et at, Parallel simulated annealing using speculative computation, IEEE Trans. on Parallel and Distributed Systems 2 (1991) 483–494.

    Article  Google Scholar 

  145. Wong, E., Stochastic neural networks, Algorithmica (NY) 6 (1991) 466–478.

    Article  Google Scholar 

  146. Xin, Y., Simulated annealing with extended neighbourhood, International J. of Computer Mathematics 40 (1991) 169–189.

    Article  Google Scholar 

  147. Xu, J., and Hwang, K., Mapping rule-based systems onto mutticomputers using simulated annealing, J. of Parallel and Distrib. Computing 13 (1991) 442–455.

    Article  Google Scholar 

  148. Yan. D., and Mukai, H., Stochastic discrete optimization, SIAM J. on Control and Optimization 30 (1992) 594–612.

    Article  Google Scholar 

  149. Zhuang, F., and Galiana, F.D., Unit commitment by simulated annealing, IEEE Trans. on Power Systems 5 (1990) 311–318.

    Article  Google Scholar 

  150. Zimmermann, T., and Salamon, P., The demon algorithm, International J. of Computer Mathematics 42 (1992) 21–31.

    Article  Google Scholar 

  151. Zissimopoulos, V. et al, On the approximation of NP-complete problems by using the Boltzmann machine method-the cases of some covering and packing problems, IEEE Trans. on Computers 40 (1991) 1413–1418.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark

    Prof. Dr. René V. V. Vidal (Professor in Operations Research)

Authors
  1. Prof. Dr. René V. V. Vidal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark

    René V. V. Vidal (Professor in Operations Research) (Professor in Operations Research)

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vidal, R.V.V. (1993). Introduction. In: Vidal, R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46787-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46787-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56229-0

  • Online ISBN: 978-3-642-46787-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation