How would you choose those 'radical variations'?
I haven't found a good method yet. So far I've tried:
None of these seems to prevent the local minima phenomena.
The best approach I've found is once the top N stop changing; throw them all away (remembering the best 1) and start over with a completely new set of random picks.
In reply to Re^5: Travelling problem (Anyone better 86850?)
by BrowserUk
in thread Travelling problem
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |