On constructing the shortest circuits on a set of line segments

This paper deals with the problem of defining the Hamiltonian cycle on segments by the ant colony algorithm. Parameters and properties of this algorithm as applied to the cutting chart for the NC machine and an arbitrary set of segments are studied.