Fig. 3

Scheme of the optimization process. First, \(G^{0}\) is created as random networks that satisfy the optimization constraints (M, edge length, etc.). Then, to create the new generation, the algorithm picks the best networks from the previous generation and creates new networks by mutating and recombining the best networks. The new generation is finally created by combining the best networks from the previous generation, mutations and recombinations of randomly selected best networks, and purely random networks that satisfy the optimization constraints. Then, the procedure is applied to the new generation. The process is repeated for \(G^{N}\) generations