Font Size: a A A

The Optimization Algorithm Design And Implementation Of Circle Stock Problem

Posted on:2018-12-23Degree:MasterType:Thesis
Country:ChinaCandidate:Q Q XieFull Text:PDF
GTID:2359330542483640Subject:Software engineering
Abstract/Summary:PDF Full Text Request
The circle cutting problem exists in various production areas,it has a deep industrial application background,such as the cutting of the stator and rotor of the motor industry,the cutting of the circular parts of automobiles,ships and aircrafts,as well as the cutting of the bottoms of pots,bowls,dishes and cups,and so on.It is very important to design an optimized cutting program to reduce the loss of raw materials,simplify the production process,reduce the pressure of enterprise inventory management and improve the productivity and industry competitiveness of enterprises.This paper discusses the many types but small number circular blanks of the circle cutting problem firstly,and further considering the generation of standard leftover in general circle cutting stock problem,in order to realize the follow-up orders to effective use the stock of the last orders,and improve the value of leftover for secondary use.Thus,the main contents as follows:(1)The many types but small number circular blanks are optimized grouping based on the sequential heuristic algorithm,this paper puts forward the sequential grouping heuristic algorithm to solve the circle cutting problem.The recursive algorithm is used to realize full-page layout process of the sheet,and the blank value correction strategy is introduced to iterate the value of circular blank for guiding the blanks with different sizes distributed evenly and avoiding the local optimum.Finally,choose the one which has the highest stock utilization obtained in multiple layout schemes as the best solution of the problem.(2)Add leftover in general circle cutting problem.Put forward the concept of standard leftover,and discuss the circle cutting problem with leftover.Define the concept of the standard leftover,and build the mathematical model of the maximum value of blanks and leftovers,using the sequential heuristic algorithm combined with recursion strategy to solve the single-stage vertical cutting problem.The algorithm is belong to the simple technology process,it can meet the requirement of remaining material recycle and it is suitable for the long-term production process.(3)Using the C#programming language to design the system of circle cutting problem.By compared with references and the random instances,it suggests that the two algorithms have a better material utilization,and they have a definite guiding significance in actual production applications.
Keywords/Search Tags:sequential grouping heuristic algorithm, standard leftover, recursion strategy, circle cutting problem, mathematical model
PDF Full Text Request
Related items