Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^5: Travelling problem (Anyone better 86850?)

by BrowserUk (Pope)
on Dec 23, 2013 at 16:11 UTC ( #1068211=note: print w/ replies, xml ) Need Help??


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.


Comment on Re^5: Travelling problem (Anyone better 86850?)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068211]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (6)
As of 2015-07-02 23:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (47 votes), past polls