*Simulated annealing (SA)* is a generic
probabilistic<http://en.wikipedia.org/wiki/Probabilistic_algorithm>
metaheuristic <http://en.wikipedia.org/wiki/Metaheuristic> for the global
optimization <http://en.wikipedia.org/wiki/Global_optimization>
problem of applied
mathematics <http://en.wikipedia.org/wiki/Applied_mathematics>, namely
locating a good approximation to the global
optimum<http://en.wikipedia.org/wiki/Global_optimum> of
a given function <http://en.wikipedia.org/wiki/Function_(mathematics)> in a
large search space <http://en.wikipedia.org/wiki/Search_space>. It is often
used when the search space is discrete (e.g., all tours that visit a given
set of cities). For certain problems, simulated annealing may be more
effective than exhaustive
enumeration<http://en.wikipedia.org/wiki/Brute_force_search> —
provided that the goal is merely to find an acceptably good solution in a
fixed amount of time, rather than the best possible solution.
http://en.wikipedia.org/wiki/Simulated_annealing
On Fri, Apr 8, 2011 at 11:08 AM, Cyrille Delaunay <cy.delaunay(a)gmail.com>wrote;wrote:
Hello,
Last year I ported some packages about 'Simulated Annealing' from
VisualWorks.
I am not sure what this is about and what does 'Simaulated Annealing' mean
exactly, But I recently remembered that I had it in my repository with all
tests green at least :)
So in case it can be usefull or it can interest somoene. I just put them
in a new repository:
www.squeaksource.com/SimulatedAnnealing
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
Saludos cordiales,
Guillermo Schwarz
Sun Certified Enterprise Architect