Edge Orientation and the Design of problem-specic EAs forthe OCST problem
We study the Euclidean variant of the optimalcommunication spanning tree (OCST) problem. An experimentalanalysis reveals that edges in optimal trees do not only have lowdistance weights but also point with higher probability towardsthe graph’s center. Consequently, we use this characteristic ofoptimal solutions for the design of problem-specific evolutionaryalgorithms (EAs).[...]