I'm trying to develop a genetic algorithm that will find the most efficient way to connect a given number of nodes at specified locations.
All the nodes on the network must be able to connect to the server node and there must be no cycles within the network. It's basically a tree.
I have a function that can measure the "fitness" of any given network layout. What's stopping me is that I can't think of a crossover function that would take 2 network structures (parents) and somehow mix them to create offspring that would meet the above conditions.
Clarification: The nodes each have a fixed x,y coordiante position. Only the routes between them can be altered.
© Stack Overflow or respective owner