Abstract
Packing problem should consider three factors of pattern value,cutting techniques and computation time.A new deterministic algorithm is proposed for generating the optimal two-segment cutting patterns for rectangular blanks based on the homogenous block.This paper's algorithm is appropriate for the shearing and punching process.Both simple patterns can be obtained and value-to-time can be improved.This algorithm uses a dynamic programming to generate optimal homogenous blocks,solves one-dimensional knapsack problems to obtain the homogenous block layouts on the sections and the section layout on segments,and optimally selects two segments to compose the cutting pattern.The algorithm is tested through three group classic problems,and compares with three famous algorithms.The computational results indicate that this paper's algorithm is better than the above four algorithms.The algorithm is efficient in improving material usage,and the computation time is reasonable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
