Computing closely matching upper and lower bounds on textile nesting problems

Computing closely matching upper and lower bounds on textile nesting problems

0.00 Avg rating0 Votes
Article ID: iaor19992947
Country: Netherlands
Volume: 108
Issue: 3
Start Page Number: 473
End Page Number: 489
Publication Date: Aug 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: optimization: simulated annealing
Abstract:

We consider an industrial cutting problem in textile manufacturing and report on algorithms for computing cutting images and lower bounds on waste for this problem. For the upper bounds we use greedy strategies based on hodographs and global optimization based on simulated annealing. For the lower bounds we use branch-and-bound methods for computing optimal solutions of placement subproblems that determine the performance of the overall subproblem. The upper bounds are computed in less than an hour on a common-day workstation and are competitive in quality with results obtained by human nesters. The lower bounds take a few hours to compute and are within 0.4% of the upper bound for certain types of clothing (e.g., for pants).

Reviews

Required fields are marked *. Your email address will not be published.