Genetic Algorithms and Very Fast Simulated Reannealing: a Comparison Lester Ingber

نویسنده

  • Lester Ingber
چکیده

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. Genetic Algorithms & VFSR -2Ingber & Rosen

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mesoscopic Neural Networks - 3 - Lester Ingber V ′ = G Σ V ′ ′

A series of papers over the past decade [the most recent being L. Ingber, Phys. Rev. A 44, 4017 (1991)] has developed a statistical mechanics of neocortical interactions (SMNI), deriving aggregate behavior of experimentally observed columns of neurons from statistical electrical-chemical properties of synaptic interactions, demonstrating its capability in describing large-scale properties of sh...

متن کامل

Draft of Paper Appearing In: %a L. Ingber %t Very Fast Simulated Re-annealing %j Mathl. Comput. Modelling %v 12 Very Fast Simulated Re-annealing Very Fast Re-annealing -2- Lester Ingber

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

متن کامل

Learned - 3 - Lester Ingber 2 . 1

Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using other previous simulated annealing algorithms. The author’s ASA code has been publicly available for over two years. During this time the author has volunteered to help people via e-mail, and the feedback obtained has been...

متن کامل

ASA Lessons Learned - 3 - Lester

Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using other previous simulated annealing algorithms. The author’s ASA code has been publicly available for over two years. During this time the author has volunteered to help people via e-mail, and the feedback obtained has been...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992