Optimization processing of the elementary surfaces of the composite body parts on machines such as ?machining center?

This article describes the processing optimization and minimizing the number of tool changes. Two versions for setting the processing scheme, according to the rules for processing scheme setting for the ?processing center? machines were offered. In the first version, according to the classical technology processing of each hole is carried out over all the passes, providing for the required accuracy of sizes and shapes. In the second version the number of tool changes is minimized. This method consists of dividing all the holes into groups according to their diameters. All the holes of the same diameter are processed over one pass; then the tools are changed and the holes of some other diameter are processed and so on. Let us consider the optimization problem. The traveling salesman problem - is one of the most famous problems in the theory of combinatorics. The problem is as follows: a travelling salesman (hawker) must find the most advantageous route coming out of a town and visiting all other towns from 2,3,…to...n just once in an unknown order and come back to the first town. The distances between all the towns are known. It is necessary to determine in what order the Salesman must visit the towns so that the route should be the shortest. There exists just one absolutely precise algorithm - sorting options. This option is the longest, so the most inefficient. There are also simpler methods to solve the traveling salesman problem: the branch and bound algorithm and ant colony method and method of genetic algorithms