Study on Packing Problem of Two Kinds of Cylindrical Goods
The packing problem of two kinds of cylindrical goods is a complex NP hard problem.Most of the existing solutions describe the problem as odd and even layers,and the number of each layer.It needs to round up or down to determine the relevant values,so it is difficult to build a mathematical model for accurate solution and improve the degree of optimization.Most of the existing solutions are heuristic and recursive intelligent search methods.Although these methods can solve many packing or cutting problems,they are relatively complex,cumbersome,difficult to master and be applied.In order to overcome these problems,a simple solution is put forward.On the one hand,the new solution redescribes the problem,which is divided into alignment layer,odd number layer and even number layer,and it is convenient to build the mathematical model.On the other hand,according to the upper limit of the remaining size,the range of variable values is reduced,so that the scale of the problem is sharply reduced,which can be effectively solved by programming.The new method is relatively simple and easy to master,and has a high degree of optimization.
two kinds of cylindrical goodspacking problemnew simple solutionoptimization degree
万方数据
维普
