good chemistry is complicated,and a little bit messy -LW PerlMonks

Re: A Beginning Guide To Evolutionary Algorithms

by Jaap (Curate)
 on Oct 14, 2003 at 09:47 UTC ( #299072=note: print w/replies, xml ) Need Help??

in reply to A Beginning Guide To Evolutionary Algorithms

Perhaps for a nice discussion, we could try to implement the "travelling salesman problem" where a salesman has to visit a bunch of points represented as (x,y) coordinates in such a way that the total distance travelled (the length of the path) is minimized (this is the fitness criterium)

We'd need a good representation of a solution, perhaps a 2D array with a series of (x,y) coordinates. We'd also need a subroutine to calculate the length of the path. And we'd need the crossover() and mutate() functions.
• Comment on Re: A Beginning Guide To Evolutionary Algorithms

Create A New User
Node Status?
node history
Node Type: note [id://299072]
help
Chatterbox?
 [Corion]: marto: Yeah - their mother picked all three of them up at the kindergarden to then go to the hospital, and all three of them were well behaved, and all also were quite obedient when they came home, so they recognized the situation [Corion]: Nice to see that the kids have some understanding of important things that happen and the appropriate behaviour :)

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (8)
As of 2016-12-08 09:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
On a regular basis, I'm most likely to spy upon:

Results (137 votes). Check out past polls.