in reply to Re^4: Travelling problem (Anyone better 86850?)
in thread Travelling problem
How would you choose those 'radical variations'?
I haven't found a good method yet. So far I've tried:
- Swapping pairs of nodes for the top N so far.
- Shuffling the nodes between two random points for the top N so far.
- Reversing the nodes between two random picks for the top N so far.
- Adding N new totally random shuffles to the set being evolved.
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.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
|
|---|
In Section
Seekers of Perl Wisdom