Research on rectangular layout optimization based on improved sparrow search algorithm
The research on the two-dimensional nesting optimization of rectangular pieces,based on an improved sparrow search algorithm,can enhance the efficiency of current nesting algorithms and provide a theoretical foundation for practical engineering applications.The paper deviates from standard sparrow algorithms,introducing the Tent chaotic mapping and the Metropolis criterion criterion for probability to determine the order of rectangular pieces.The Lowest Horizontal Line Algorithm is then utilized to arrange the placement positions of these rectangular pieces.The results indicate that initializing the sparrow population with Tent chaotic mapping leads to a more uniform distribution of the population,enhancing the algorithm's global search capability during the two-dimensional nesting process of rectangular pieces.The use of the Metropolis criterion for updating the positions of sparrow individuals strengthens the algorithm's ability to avoid local optima during the optimization process.The improved sparrow search algorithm increases raw material utilization by 3.5%,reduces nesting time by 55 seconds,and decreases raw material length consumption by 355.5 mm.These validate the feasibility of the combined optimization of the Lowest Horizontal Line Algorithm and the improved sparrow search algorithm for two-dimensional nesting problems of rectangular pieces.
万方数据
维普
