Syndicate this site: (RSS)

A nice problem for GAs

Dave Thomas presents Stiener's Problem; an interesting optimization problem, minimizing the number of connections required to connect a set of points, which serves as a non trivial example of a problem that can be analyzed using targetless genetic analysis.

My only objection to the approach is that I'd rather see an entire binary sequence used, rather than the mix of base 10 and base 2. But that's an implementation detail, really.

July 6, 2006 2:14 AM | TrackBack

Comments
Post a comment




Who are you?