An Improved Algorithm for Rectangular Parts Blank Layout On The Basis of the Lowest Horizontal Line
Guanhua Zhu
Abstract
Guanhua Zhu
Abstract
Rectangular parts blank layout optimization is a multi-objective optimization problem in which the utilization of material,the cutting efficiency,and the cutting pattern satisfying the requirement of guillotine should be taken into account.On the basis of the Lowest Horizontal Line-Search Algorithm(LHL-SA),a new algorithm for rectangular packing is proposed.The experimental results indicate that the algorithm is flexible and effective.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Rectangular parts blank layout optimization is a multi-objective optimization problem in which the utilization of material,the cutting efficiency,and the cutting pattern satisfying the requirement of guillotine should be taken into account.On the basis of the Lowest Horizontal Line-Search Algorithm(LHL-SA),a new algorithm for rectangular packing is proposed.The experimental results indicate that the algorithm is flexible and effective.
Key concepts: Blank, Basis (linear algebra), Line (geometry), Algorithm, Computer science, Mathematics, Mathematical optimization, Engineering