Abstract
To solve the optimum packing of two-dimensional rectangle layout problem,a heuristic dynamic decomposition algorithm was proposed,which can be used in the three-dimensional rectangule layout and global optimization problems.The container was orthogonally decomposed according to the emission rectangles,and the best sub-container was selected according to the degree of place coupling,then the state of all containers was updated by the interference relationship,so the large-scale and complex problem can be solved quickly and efficiently.The experimental results of the Bench-mark cases internationally recognized show that the proposed algorithm has better performance compared with similar algorithms,in which the layout utilization efficiency is increased by 9.4% and the calculating efficiency is improved up to 95.7%.Finally the algorithm has been applied to the commercialized packing software AutoCUT,and it has good application prospects.
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 callDisclaimer: 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.
