A very fast simulated re-annealing algorithm for the leather nesting problem
- 195 Downloads
This article presents a novel approach for effectively optimizing the nesting problem in the leather manufacturing. A very fast simulated re-annealing (VFSRA) algorithm is developed for the placement of two-dimensional irregular sheets and stencils. Theoretically, this algorithm is exponentially faster than Cauchy and Bolzmann annealing approaches. Irregular profiles are represented by approximate polygons using geometrical processing of Weiler tuple. The search configuration space is considerably reduced by using a module slide technique. Compact nesting density is fulfilled by severe penalties of escaping and overlapping areas and the normal penalty of unoccupied area defined in the cost function. The designed stencil motion strategy and annealing schedule are suitable. Comparison of the experimental results show that the VFSRA is effective for the leather nesting problem. In addition, it can be applied in other similar fields.
KeywordsNesting Optimization Simulated annealing Two-dimensionally irregular Weiler tuple
Unable to display preview. Download preview PDF.
- 1.Xing W, Xie J (2000) Modern optimization calculation methods. Tshinghua University Publisher, BeijingGoogle Scholar
- 4.Gruca TS, Klemz BR, Optimal new product positioning: s genetic algorithm approach. Eur J Oper Res 146:621–633Google Scholar
- 12.Mergenthaler W, Mauersberg B, Feller J, Stuehler LJ (2003) Application of the simulated annealing local search technique to problems of redundancy elimination in functional and parametric tests of integrated circuits. Math Comp Simul 62443–451Google Scholar
- 15.Van Laarhoven P, Aarte E (1987) Simulated annealing: theory and applications. D. Reidel, Dordrecht, The NetherlandsGoogle Scholar
- 16.Foley JD, Feiner SK (1990) Computer graphics: principles and practice, 2nd edn. Addison-Wesley, BostonGoogle Scholar