Author:
Ji Jun,Cui Jian,Xing Feifei
Abstract
Abstract
The problem of packing is a problem often encountered in the early stages of advanced manufacturing application field. This paper first describes the two-dimensional nesting problem, and then analyzes three optimization techniques to solve the two-dimensional nesting problem, the mathematical model and solution process of dynamic programming, knapsack algorithm and linear programming algorithm.
Subject
General Physics and Astronomy
Reference8 articles.
1. Minimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using orthogonal guillotine cuts[J];Agrawal;European Journal of Operational Research,1993
2. Discrete Variable Extremum Problems[J];Dantzig;Operations Research,1957
3. New algorithm of solving 0-1 knapsack problem based on dynamic telescopic strategy[J];Shouheng;Computer Engineering and Applications,2012
4. Tight bounds for periodicity on the unbounded knapsack problem[J];Huang;European Journal of Operational Research,2011