🔒 Locked

Solving Problems

Started by Dovyman May 3, 2004 at 4:33 PM 0 replies 450+ views

Original Post

May 3, 2004 at 4:33 PM

I hate to pick a method before a problem, but I''ve often heard that in particular GA''s are very good for solving difficult (or otherwise impossible) math problems, like diophantines. What sort of math or other problems can you solve using this method, or any other interesting algorithms for that matter?

Timkin

149

Timkin

May 3, 2004 at 7:17 PM

Genetic Algorithms are an algorithm for solving blind search problems (although that does not limit them to such problems). Blind search problems are such that given an input state, x , one does not have an analytic mapping, f(), from inputs to outputs, such that y = f(x ). This means that we cannot compute the analytic derivatives of f w.r.t x , which makes traditionally optimisation routines inappropriate. In blind search, all that is available are function evaluations for a given input (which can be thought of as a black box routine...put in an input, get an output).

GAs have also been shown to be useful on stochastic mappings. That is, where the output y is a stochastic variable (meaning the function is noisy).

Cheers,

Timkin

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.