Simulated Annealing

1

E. Aarts and J. Korst.
Simulated Annealing and Boltzmann Machines.
Wiley & Sons, 1989.

2

Neighbourhood size in the simulated annealing algorithm.
Am. J. of Mathematical and Management Sciences, (3/4):409-423, 1988.

3

R. Azencott.
Simulated Annealing: Parallelization Techniques.
Wiley & Sons, 1992.

4

V.C. Barbosa.
A distributed implementation of simulated annealing.
J. of Parallel and Distributed Computing, 6:411-434, 1989.

5

K.M. Cheh, J.B. Goldberg, and R.G. Askin.
A note on the effect of neighbourhood structure in simulated annealing.
Computers Operations Research, 18(6):537-547, 1991.

6

G. Dueck and T. Scheuer.
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing.
?, pages 161-175, 1990.

7

D.E. Goldberg.
A annote on boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing.
Complex Systems, 4:445-460, 1990.

8

D.R. Greening.
A taxonomy of parallel simulated annealing techniques.
Technical report, University of California, Los Angeles, 1989.

9

L. Ingber.
Simulated annealing: Practice versus theory.
Mathl. Comput. Modelling, 18(11):29-57, 1993.

10

L. Ingber and B. Rosen.
Genetic algorithms and very fast simulated reannealing: a comparison.
Mathl. Comput. Modelling, 16(11):87-100, 1992.

11

D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon.
Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning.
Operations Research, 39(2):378-406, 1991.

12

P. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi.
Optimization by simulated annealing.
Research Note RC 9355, IBM, 1982.

13

S. Kirkpatrick, C.D. Gelatt jr., and M.P. Vecchi.
Optimization by simulated annealing.
Science, 220(4598):671-680, May 1983.

14

P.S. Laursen.
Problem-independent parallel simulated annealing using selection and migration.
In Parallel Problem Solving from Nature III, pages 408-417, 1994.

15

F.H. Lee, G.S. Stiles, and V. Swaminathan.
Parallel annealing on distributed memory systems.
Programming and Computer Software, Jan. 1995.

16

S.W. Mahfoud and D.E. Goldberg.
A genetic algorithm for parallel simulated annealing.
pages 301-310.

17

M. Malek, M. Guruswamy, and M. Pandya.
Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem.
Annals of Operations Research, 21:59-84, 1989.

18

F. Romeo and A. Sangiovanni-Vincentelli.
A theoretical framework for simulated annealing.
Algorithmica, 6:302-345, 1991.

19

B. Rosen.
Function optimization based on advanced simulated annealing.
In Workshop on Physics and Computation. IEEE Computer Society, 1992.

20

P. Roussel-Ragot and G. Dreyfus.
A problem independent parallel implementation of simulated annealing: Models and experiments.
IEEE Transactions on Computer-Aided Design, 9(8):827-835, 1990.

21

P. Roussel-Ragot, N. Kouicem, and G. Dreyfus.
Error-free parallel implementation of simulated annealing.
pages 231-241.

22

G. Rudolph.
Massively parallel simulated annealing and its relations to evolutionary algorithms.
Evolutionary Computation, 1(4), 1994.

23

Chang song Zhou and Tian lun Chen.
Chaotic annealing for optimization.
Physical Review E, 55(3):2580-2587, 1997.

24

G.B. Sorkin.
Simulated annealing on fractals: Theoretical analysis and relevance for combinatorial optimisation.
In W.J. Dally, editor, Advanced Research in VLSI, Proceedings of the 6th MIT Conference, pages 331-351, 1990.

25

P.J.M. van Laarhoven, C.G.E. Boender, E.H.L. Aarts, and A.H.G. Rinnooy Kan.
A bayesian approach to simulated annealing.
Technical report, ?