Research On Cutting Path Optimization With Two Dimensional Stone Sawing

With the rise of stone industry and the demand of stone product is increasing day by day, the enterprise is required to improve the processing efficiency more and more frequently. In order to improve efficiency, cut path naturally became the object of many researchers. With a good cutting path, the company would improve the processing efficiency directly without any extra cost. Therefore, it is important to find the optimal cutting path.In order to study the cutting path optimization problem of the stone saw, first, the paper described the structure and function of the stone bridge cutting machine and analysis the process of sawing. Since the process of sawing involves the problem of sawing tool rotation angle, and the time-consuming of the blade’s rotation angle is proportional to the size of the angle. Different from the cutting path optimization based on the shortest idle stroke, this paper proposed a cutting path optimization algorithm based on the process of shortest time-consuming. In order to establish a mathematical model for the cutting path optimization algorithm, this paper analysis the adjusted angle of the blade during the sawing process, introduced the concept of the blade’s adjust angle of the pattern internal and between, and analysis the components of the complete cutting path and the determinants of the processing time of every component, acquire the mathematical model finally.After analysis the mathematical model, we know that the cutting path optimization problem is a combinatorial optimization problem essentially. Combined the characteristic of combinatorial optimization problem’s solution space, this paper adopt a step-solving idea for solve the cutting path optimization problem, simplify the problem by the step-solving idea and improved the solving speed. The first step is using a minimum interior angle method which is proposed in this paper to determine the start and end cutting point of each pattern. The second step is using the genetic algorithm to determine the cutting sequence of the pattern’s start and end cutting point, optimize the cutting path eventually. The minimum interior angle method is a heuristic algorithm, with the principle of min the blade’s adjust angle of the pattern internal, it can quickly determines the start and end cutting point of each pattern. Design the genetic algorithm combined with the constraints which are the blade’s adjust angle of the pattern internal and between of pattern cutting sequence. The fitness function is the reciprocal of the blade’s rotation angle time-consuming and the level idling time-consuming, it is used to evaluate the different cutting sequence; Crossover the paired chromosomes with the part of single point crossover and mutation with the manner of swap the location of genes in a random. Realize the solving simulation with an example of cutting path optimization in the MATLAB software. Compared the result with using the nearest neighbor algorithm to determine the starting and ending cut point, then using ant colony algorithm to determine the pattern cutting sequence, using the method which proposed in this paper based on the shortest processing time, the part of cutting path’s processing time is88.9percent of the before. Demonstrate the effectiveness of the proposed algorithm.