Abstract
This paper presented an algorithm for generating the homogenous strip T-shape layouts for large-scale rectangular piece packing.The algorithm not only achieved good results within reasonable time,but also met the shearing and punching process need.The algorithm generated optimal homogenous strips,solved knapsack problems to obtain the strip layouts on the sections and the section layouts on the segments,and optimally selected two segments to compose the layouts.The algorithm was tested on 63 benchmark problems,and compared with five famous algorithms(the classic two-stage,the general T shape,the two-stage homogenous block,the general cutting pattern and the heuristic algorithm TABU500).The computational results indicate that the algorithm is efficient in both the computation time and the material utilization rate.
Published Version
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 call