|
in reply to Re^3: Travelling problem (Anyone better 86850?)
in thread Travelling problem
That makes sense. I found I had to keep adding variations to avoid dead ends, the shuffles in particular helped. How would you choose those 'radical variations'? At random from the laggards, or according to some other criteria, some way of spotting potential? |
Re^5: Travelling problem (Anyone better 86850?)
by BrowserUk (Patriarch) on Dec 23, 2013 at 16:11 UTC
|
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.
| [reply] |
|
