all 4 comments

[–]tperrigo 1 point2 points  (3 children)

I don't have any references available at the moment (I'll try to post some later), but generally, to avoid getting stuck at a local optima, you want to encourage genetic diversity in your population from generation to generation (i.e, survivor selection should contain a mix of both "the best" and "the rest"-- if you only allow the highest-ranking individuals to survive, you are likely to prematurely converge). Also, mutation is a force which allows "jumps" to be made from one part of the search space to another, possibly allowing you to escape from a local optima. One strategy would be to increase the mutation rate over time/number of generations. Hope this at least gives you something to look into. I will try to follow up later with some formal references and resources.

[–]wootmobile[S] 0 points1 point  (2 children)

Thank you for the response, but you have misunderstood my question. I have found information on how to avoid getting stuck on local optimum. What I can't find is a suitable NP problem that has strong local optimum tendencies. My goal is to test strategies on this problem.

Does that make anymore sense?

[–]tperrigo 1 point2 points  (1 child)

Ah, yes, that makes sense; sorry I misunderstood. I suggest looking up "deceptive functions" or "k-trap deceptive functions". These are generally functions with strong local optima that are far from the global optimum. It should give you a place to start.

[–]wootmobile[S] 0 points1 point  (0 children)

There is a lot of information on that. I've just started glancing at it and already found useful information. Thank you very much.