Research on rectangular nesting using hybrid improved tabu search and greedy algorithm
CHU Dexin
ZHANG Pengfei
HOU Sensen
DING Jianfei
ZHANG Hongzhong
Abstract:To address the issues of excessive cutting operations and low material utilization rates in rectangular sheet cutting for specialized vehicle manufacturers,this study proposes a nesting method that integrates an optimized tabu search algorithm with a greedy algorithm.First,a two-stage mathe-matical model for sheet cutting is established.The tabu search(TS)algorithm is enhanced to generate optimized initial layouts while meeting cutting operation constraints:Initial solutions are refined using a genetic algorithm(GA)incorporating a predation strategy,while iterative processes are improved through inferior solution acceptance and adaptive forgetting strategies.Next,a greedy algorithm guided by waste area minimization principles is implemented to reuse residual materials,further boos-ting material utilization.Experimental validation using three datasets from Company E demonstrates that the proposed algorithm achieves a material utilization rate exceeding 90%while minimizing large waste areas,outperforming standalone GA and TS algorithms and better addressing the company's production requirements.
Keywords:rectangular sheet cuttingtabu search algorithmgreedy algorithm
Publication Date:2025-06-25
Online Publishing Date:2025-08-15(First online date of this platform, not the publication date of the document)
Pages:7( 20-26 )
