Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

Re: A Beginning Guide To Evolutionary Algorithms

by Jaap (Curate)
on Oct 14, 2003 at 09:47 UTC ( [id://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.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2024-03-29 07:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found