Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

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

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

in reply to Re^2: Travelling problem (Anyone better 86850?)
in thread Travelling problem

Similar methodology to mine, and the same problem.

Many times it will find the minima well within your 1000 generations; but on those occasions where it settles into a false minima; it doesn't (seem to; limited runs) matter how many more generations you run it for; it will never find it.

That's what I've been trying to find a solution to for the last couple of days. So far, without much success.

The problem appears to be that if you discard too vigorously, you settle into re-trying variations of the same paths over and over without ever introducing any "new blood".

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^3: Travelling problem (Anyone better 86850?)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068260]
[marto]: impressive

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (5)
As of 2017-07-28 11:42 GMT
Find Nodes?
    Voting Booth?
    I came, I saw, I ...

    Results (428 votes). Check out past polls.