During the construction of wooden parts of playground equipment a certain manifacturing step requires the drilling of a number of holes into the parts. The pre--defined location of the holes allows an optimization of the temporal sequence of drilling the individual holes on a CNC machine. In essence, this problem is a reformulation of the well--known Travelling Salesperson (TSP) Problem. Evolutionary Algorithms have been demonstrated to be a promising method for finding (sub)optimal solutions of various instances of TSP problems. In experiments with the real-world data an EA specifically adapted to the problem at hand should be constructed using Java and C prototypes. Then, the final algorithm should be integrated into the CNC programs actually controlling the drilling device.