Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2015-10-04 15:33 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (103 votes), past polls