Genetic Algorithms vs. Monte Carlo

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
3 replies · 9K views
maverick_starstrider
Messages
1,118
Reaction score
7
Hi, other than the Traveling Salesman Problems can anyone help me think of relatively simple problems/projects that are solvable through BOTH genetic algorithm techniques AND monte-carlo methods (such as simulated annealing and metropolis-hastings). Any help is greatly appreciated.
 
Physics news on Phys.org
maverick_starstrider said:
Hi, other than the Traveling Salesman Problems can anyone help me think of relatively simple problems/projects that are solvable through BOTH genetic algorithm techniques AND monte-carlo methods (such as simulated annealing and metropolis-hastings). Any help is greatly appreciated.

You certainly can use both on circuit optimization problems.
 
Find the global minimum of Rosenbrock's function,

[tex]f(x,y) = (1-x)^2 + 100\left(y-x^2\right)^2[/tex]
 
Can either method find a global minimum?