Font Size: a A A

Research On Cutting Algorithm Of Circular Parts Based On Genetic Algorithm

Posted on:2020-12-25Degree:MasterType:Thesis
Country:ChinaCandidate:Z Y ZengFull Text:PDF
GTID:2392330611982440Subject:Computer technology
Abstract/Summary:PDF Full Text Request
The cutting stock problem of circular parts widely exists in many manufacturing industries.Using advanced computer-aided layout technology to replace the traditional manual layout can effectively improve the utilization of materials,which is of great significance to improve the production efficiency of enterprises and reduce production costs.In the past research,scholars used heuristic method to solve the cutting stock problem of circular parts,heuristic method has high efficiency but the performance is not stable,so this paper considers to study on the basis of genetic algorithm,and designs an algorithm with better performance for the cutting stock problem of circular parts,so as to obtain a better cutting plan,improve the utilization rate of materials and reduce the production cost.The main research work of this paper includes:(1)Basing on genetic algorithm,a parallel genetic cutting algorithm is designed to solve the cutting problem of circular parts.Using the utilization ratio of the material as the optimization objective,the initial population is generated by combining the sequential heuristic method with the value correction function of circular parts.Then starting from the initial population,the multi-threaded genetic operation is adopted to parallel the population.In the genetic operation,the selection operator,adaptive crossover operator and mutation operator with better performance are used to improve the search ability of the algorithm.(2)In order to solve the cutting problem of multiple sheets and leftover for circular parts,a parallel genetic annealing algorithm is designed to be more appropriate for the actual production needs of enterprises,and further improve the utilization rate of materials.Based on the parallel genetic blanking algorithm,combined with the advantages of the simulated annealing algorithm,which has good local search ability,the search performance of the algorithm is improved,and the utilization strategy of the circular part leftover is introduced to standardize the management and utilization of the circular part leftover produced by the order within a period of planning,so as to improve the long-term material utilization.(3)Two algorithms are implemented by C# language and the prototype of the experimental system is developed.Firstly,the relevant parameters of the algorithm are determined by the experimental test,and then the effectiveness of the algorithm is verified by the comparison of random examples and other literature algorithms.Experimental results show that the algorithm proposed in this paper can effectively improve the utilization rate of materials,and play a guiding role in the actual production.
Keywords/Search Tags:cutting stock of circular parts, genetic algorithm, simulated annealing algorithm, heuristic method, dynamic programming
PDF Full Text Request
Related items