## Facts, Conjectures, and Improvements for Simulated AnnealingSimulated annealing has proved to be an easy and reliable method for finding optimal values of a problem in cases where there is no road map to possible solutions. Facts, Conjectures, and Improvements for Simulated Annealing offers an introduction to this topic for novices and provides an informative review of the area for the more expert reader. This book brings together for the first time many of the theoretical foundations for improvements to algorithms for global optimization that until now existed only in scattered research articles. The method described in this book operates by simulating the cooling of a (usually fictitious) physical system whose possible energies correspond to the values of the objective function being minimized. The analogy works because physical systems occupy only states with the lowest energy as the temperature is lowered to absolute zero. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

MM07_pt1 | 2 |

MM07_ch1 | 3 |

MM07_ch2 | 7 |

MM07_ch3 | 17 |

MM07_ch4 | 19 |

MM07_pt2 | 22 |

MM07_ch5 | 25 |

MM07_ch6 | 35 |

MM07_ch10 | 67 |

MM07_ch11 | 75 |

MM07_ch12 | 79 |

MM07_ch13 | 89 |

MM07_ch14 | 99 |

MM07_pt4 | 102 |

MM07_ch15 | 105 |

MM07_ch16 | 119 |

### Other editions - View all

Facts, Conjectures, and Improvements for Simulated Annealing Peter Salamon,Paolo Sibani,Richard Frost No preview available - 2002 |

Facts, Conjectures, and Improvements for Simulated Annealing Peter Salamon,Paolo Sibani,Richard Frost No preview available - 2002 |

### Common terms and phrases

acceptance probability adaptive annealing schedule approach approximation average basin hopping behavior Boltzmann distribution calculate coarse-grained combinatorial configuration space constant thermodynamic speed cooling schedule correlation function corresponding decreases density dependence described discrete discussed in Chapter dynamics Ebsf eigenvalue eigenvector energy landscape ensemble entropic entropic barrier equal equations equilibration ergodic estimate example exponential finite given global optimization graph bipartitioning heuristics implementations infinite temperature initial inverse K. H. Hoffmann local minimum lowest energy lumped Markov chain Mathematical mean energy Metropolis acceptance microstates minimize minimum Monte Carlo move class neighbors nodes notation objective function optimization problems parameter performance physical system random walker reader relaxation Salamon sampling scale seismic Sibani simulated annealing simulated annealing algorithm simulated annealing problem solution spin glass stationary distribution statistical mechanics steps structure techniques theorem thermal threshold accepting transition probabilities trap traveling salesman problem typically variance walk zero