Genetic Algorithms and Very Fast Simulated Reannealing: A comparison

Authors:
Lester Ingber;Bruce Rosen
Affiliations:
Lester Ingber Research, P.O. Box 857 McLean, VA 22101, U.S.A.;Department of Computer and Information Sciences University of Delware, Newark, DE 19716, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1992

Citing 7
Cited 17

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Application of statistical mechanics methodology to term-structure bond-pricing models

Mathematical and Computer Modelling: An International Journal
Statistical mechanics of combat with human factors

Mathematical and Computer Modelling: An International Journal
Mathematical comparison of combat computer models to exercise data

Mathematical and Computer Modelling: An International Journal
Very fast simulated re-annealing

Mathematical and Computer Modelling: An International Journal
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence

A highly robust estimator for regression models

Pattern Recognition Letters
Guided local search as a network planning algorithm that incorporates uncertain traffic demands

Computer Networks: The International Journal of Computer and Telecommunications Networking
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation

Theoretical Computer Science
Application of Kohonen network for automatic point correspondence in 2D medical images

Computers in Biology and Medicine
A stochastic version of Expectation Maximization algorithm for better estimation of Hidden Markov Model

Pattern Recognition Letters
Evolutionary intelligent agents for e-commerce: Generic preference detection with feature analysis

Electronic Commerce Research and Applications
Modified fuzzy c-means for ordinal valued attributes with particle swarm for optimization

Fuzzy Sets and Systems
Design of self tuning fuzzy controllers for nonlinear systems

Expert Systems with Applications: An International Journal
Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning

Expert Systems with Applications: An International Journal
Statistical mechanics of neocortical interactions: Training and testing canonical momenta indicators of EEG

Mathematical and Computer Modelling: An International Journal
Data mining and knowledge discovery via statistical mechanics in nonlinear stochastic systems

Mathematical and Computer Modelling: An International Journal
Statistical mechanics of financial markets: Exponential modifications to Black-Scholes

Mathematical and Computer Modelling: An International Journal
Simulated annealing: Practice versus theory

Mathematical and Computer Modelling: An International Journal
Repeated weighted boosting search for discrete or mixed search space and multiple-objective optimisation

Applied Soft Computing
Evolutionary design of optical waveguide with multiple objectives

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Comparison between coupled local minimizers method and differential evolution algorithm in dynamic damage detection problems

Advances in Engineering Software
A heuristic search algorithm for the multiple measurement vectors problem

Signal Processing

Quantified Score

Hi-index	0.98

Visualization

Abstract

We compare Genetic Algorithms (GA) with a functional search method, Very Fast Simulated Reannealing (VFSR), that not only is efficient in its search strategy, but also is statistically guaranteed to find the function optima. GA previously has been demonstrated to be competitive with other standard Boltzmann-type simulated annealing techniques. Presenting a suite of six standard test functions to GA and VFSR codes from previous studies, without any additional fine tuning, strongly suggests that VFSR can be expected to be orders of magnitude more efficient than GA.