Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Xing W, Xie J (2000) Modern optimization calculation methods. Tshinghua University Publisher, Beijing
Blazewicz J, Hawryluk P, Walkowaik R (1993) Using tabu search for solving the two-dimensional irregular cutting problem. Ann Oper Res 41:313–325
Chelouah R, Siarry P (2003) Genetic and Nelder–Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. Eur J Oper Res 148:335–348
Gruca TS, Klemz BR, Optimal new product positioning: s genetic algorithm approach. Eur J Oper Res 146:621–633
Kubotani H, Yoshimura K (2003) Performance evaluation of acceptance probability functions for multi-objective SA. Comp Oper Res 30:427–442
Henderson D, Vaughan D, Jacobson SH (2003) Solving the shortest route cut and fill problem using simulated annealing. Eur J Oper Res 145:72–84
Lee K, Han S, Roh M (2003) An improved genetic algorithm for facility layout problems having inner structure walls and passages. Comp Oper Res 30:117–138
Zhang L, Xu W, Chang C (2003) Genetic algorithm for affine point pattern matching. Pattern Recogn Lett 24:9–19
Milenkovic VJ, Daniels K (1999) Translational polygon containment and minimal enclosure using mathematical programming. Int Trans Oper Res 6:525–554
Li Z, Milenkovicv VJ (1995) Compaction and separation Algorithms for non-convex polygons and their applications. Eur J Oper Res 84:539–561
Heistermann J, Lengauer T (1995) The nesting problem in the leather manufacturing industry. Ann Oper Res 57:147–173
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–451
Pustylnik G, Sharir M (2003) The Minkowski sum of a simple polygon and a segment. Inf Process Lett 85:179–184
Bennell JA, Dowsland KA, Dowsland WB (2001) The irregular cutting-stock problem—a new procedure for deriving the no-fit polygon. Comp Oper Res 28:271–287
Van Laarhoven P, Aarte E (1987) Simulated annealing: theory and applications. D. Reidel, Dordrecht, The Netherlands
Foley JD, Feiner SK (1990) Computer graphics: principles and practice, 2nd edn. Addison-Wesley, Boston
Szu H, Hartley R (1987) Fast simulated annealing. Phys Lett A122:157-162
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yuping, Z., Shouwei, J. & Chunli, Z. A very fast simulated re-annealing algorithm for the leather nesting problem. Int J Adv Manuf Technol 25, 1113–1118 (2005). https://doi.org/10.1007/s00170-003-1966-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-003-1966-6