William E. Hart  Home/Search
Context Related
| sandia.gov/pub/papers/...Har96ep.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sandia.gov/~wehart/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper theoretically compares the performance of simulated annealing and evolutionary algorithms. Our main result is that under mild conditions a wide variety of evolutionary algorithms can be shown to have greater probability of success than simulated annealing after a sufficiently large number of function evaluations. This class of EAs includes variants of evolution strategies and evolutionary programming, genetic programming, the canonical genetic algorithm, as well as a variety of... (Update)
Context of citations to this paper: More
...slow cooling schedule in order to converge to an optimal solution with high probabilities. Genetic algorithm (GA) [112, 108, 77, 62, 109, 136, 118, 123, 86, 58, 35] is a stochastic global optimization algorithm . It maintains a population of candidate points in each generation....
...moves, it is generally not as e#cient as local search methods that only accept down hill moves. Genetic algorithm (GA) [80, 59, 133, 161, 142, 146, 93], a typical global optimization algorithm with reachability, roots itself in nature s rule of fitness to survive. As...
Cited by: More
Simulated Annealing and Genetic Algorithms - For Partial Shape (Correct)
Global Optimization For Constrained Nonlinear Programming - Wang (2001) (Correct)
Optimal Anytime Search For Constrained Nonlinear Programming - Chen (2001) (Correct)
Active bibliography (related documents): More All
0.5: Solving Sequence Problems by Building and Sampling Edge.. - Tsutsui, Goldberg.. (2002) (Correct)
0.2: Implementation Issues for Reverse Hillclimbing - This (Correct)
0.2: An Indexed Bibliography of Genetic Algorithms Papers of 1993 - Jarmo T. Alander (1996) (Correct)
Similar documents based on text: More All
0.3: Simulated Annealing with Extended - Neighbourhood Xin Yao (Correct)
0.3: Rethinking the Design of Real-Coded Evolutionary Algorithms.. - Hart (Correct)
0.1: The Eects of Locality on the Dynamics of Decoder-Based.. - Gottlieb (Correct)
Related documents from co-citation: More All
8: Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
8: Modified Controlled Random Search Algorithms (context) - Ali, Storey - 1994
7: Genetic Algorithms in Search (context) - Goldberg - 1989
BibTeX entry: (Update)
William E. Hart. A theoretical comparison of evolutionary algorithms and simulated annealing. In Evolutionary Programming V, pages 147--154, Cambridge, MA, 1996. MIT Press. http://citeseer.ist.psu.edu/hart96theoretical.html More
@inproceedings{ hart96theoretical,
author = "William E. Hart",
title = "A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing",
booktitle = "Evolutionary {P}rogramming {V}: {P}roc.~of the {F}ifth {A}nnual {C}onf.~on {E}volutionary {P}rogramming",
publisher = "MIT Press",
address = "Cambridge, MA",
editor = "Lawrence J. Fogel and Peter J. Angeline and Thomas B{\"a}ck",
pages = "147--154",
year = "1996",
url = "citeseer.ist.psu.edu/hart96theoretical.html" }
Citations (may not include all citations):1527 Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
1053 Genetic programming: On Programming Computers by Means of Na.. (context) - Koza - 1992
588 Handbook of Genetic Algorithms (context) - Davis - 1991
192 An Analysis of the Behavior of a Class of Genetic Adaptive S.. (context) - De Jong - 1975
159 A comparative analysis of selection schemes used in genetic .. (context) - Goldberg, Deb - 1991
126 Simulated Annealing: Theory and Applications (context) - van Laarhoven, Aarts - 1987
100 Genetic Algorithms and Simulated Annealing (context) - Davis - 1987
59 Genetic algorithms and very fast simulated reannealing - a c.. - Ingber, Rosen - 1992
56 Evolutionary Computation (context) - Fogel - 1995
49 Finite Markov chain analysis of genetic algorithms (context) - Goldberg, Segrest - 1987
42 An overview of evolutionary algorithms for parameter optimiz.. (context) - ack, Schwefel - 1993
38 A simulated annealing like convergence theory for the simple.. (context) - Davis, Principe - 1991
38 Genetic local search algorithms for the traveling salesman p.. (context) - Ulder, Aarts et al. - 1990
31 Solving partitioning problems with genetic algorithms (context) - Jones, Beltramo - 1991
28 Modelling genetic algorithms with Markov chains (context) - Nix, Vose - 1992
26 The application of genetic algorithms to resource scheduling (context) - Syswerda, Palmucci - 1991
26 A Markov chain analysis on a genetic algorithm (context) - Suzuki - 1993
20 Convergence and finite-time behavior of simulated annealing (context) - Mitra, Romeo et al. - 1986
16 Bounding the probability of success of stochastic methods fo.. (context) - Ferreira, Zerovnik - 1993
12 AddisonWesley Publishing Co (context) - Goldberg, in et al. - 1989
10 Genetic algorithm for clustering with an ordered representat.. (context) - Bhuyan, Raghavan et al. - 1991
10 Massively parallel simulated annealing and its relation to e.. - Rudolph - 1993
9 the convergence rate of annealing processes (context) - Chaing, Chow - 1988
6 Evolving aesthetic sorting networks using developmental gram.. (context) - Belew, Kammeyer - 1993
5 Modeling simple genetic algorithms for permutation problems - Whitley, Yoo - 1995
2 A comparison of genetic sequence operators (context) - Starkweather, McDaniel et al. - 1991
1 IEEE Transactions on Neural Networks (context) - of, algorithms - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sandia.gov/~wehart/papers.html): More
Fast Protein Folding in the Hydrophobic-hydrophilic Model.. - Hart, Istrail (1995) (Correct)
Comparing Evolutionary Programs and Evolutionary Pattern Search.. - Hart (1999) (Correct)
A Stationary Point Convergence Theory for Evolutionary Algorithms - Hart (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC