Abstract
For the problem of routing tool movements between processing zones, in a formulation close to the traveling salesman problem, a method for calculating the minimum route, as a rule, leading to an optimum on tests with dimensions of up to 150 zones, is proposed and tested.
Highlights
The applied problems of routing idle movements of the tool between a set of machining zones on CNC equipment are united by one common problem found in the symmetric traveling salesman problem
It is the case due to natural reduction in dimension. In many cases this still does not allow the use of exact methods [1,2,3,4,5] that provide optimal solutions
The limit of applicability of Little’s algorithm is no more than 45 objects [3], dynamic programming up to 30 [4, 5, 6], some sources [7] substantiate the theoretical possibility of solving such problems with up to 60 - 65 objects, but without practical confirmation of this
Summary
The applied problems of routing idle movements of the tool between a set of machining zones on CNC equipment are united by one common problem found in the symmetric traveling salesman problem. In the general case, the number of steps in some of them may turn out to be exponential [16] This situation stimulates the development and research of methods that give a sufficiently close to optimal result, and at the same time, provide the possibility of moving away from exponential complexity of the solution. For example, 3 points are selected, at the first stage the fourth point will be included in this three-term closed round (one of the totality of the remaining N-3 points) It is embedded between the 1st and the 2nd points of the three-term route, followed by automatic completion of all other points according to the general empirical algorithm. There is a basis for identifying the most universal and acceptable version for practical needs from various options of level-by-level approximation to the minimum route
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
