
Research on optimization technology based on two-dimensional packing
Author(s) -
Jun Ji,
Jian Cui,
Feifei Xing
Publication year - 2022
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2174/1/012011
Subject(s) - knapsack problem , nesting (process) , mathematical optimization , packing problems , computer science , linear programming , cutting stock problem , field (mathematics) , process (computing) , optimization problem , algorithm , mathematics , engineering , operating system , mechanical engineering , pure mathematics
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.