Development of an algorithm to generate and evaluate cutting solutions in edging and trimming operations at sawmills
Keywords:algorithm, heuristic, cutting solution, slab
In this research work an algorithm that gathers the best procedures applied in sawmills was developed, along with a methodology based on cutting geometrical line analysis. This application was programmed under the C++language, sizes objective board and its prices, and the 2-D slab geometry are the input data, obtaining length and width solutions for every slab. Its outcomes have been compared with a pattern that matches the solutions provided by an “optimized” cutting machine in a southern sawmill in Chile. Four types of solutions were obtained when inputting slabs geometry, which was captured with four different reading steps. Outcomes show that solutions achieved with a reading width of 100 mm were 4% better in average than the pattern, and far better to other solutions achieved with the remaining 3 steps.
Leaving aside the particular operating conditions of either method; a theoretical comparison of time by solution method, indicates that the 77 milliseconds SISCORMAD employed are significantly lower than those obtained with dynamic programming 320 milliseconds, 890 milliseconds with total enumeration, and 140 milliseconds obtained with geometric heuristic as solution times reported by [6 ]. This feature makes the developed algorithm very attractive for future applications. However, given the heuristic nature SISCORMAD, it is just a high quality solution, but not optimal.
S. Rony. Edging and trimming operations and optimization. Course notes of Sawmilling Techniques. Ed. Kymenlakson University of applied Sciences. Kotka. Finlandia. 2004. pp. 1-20.
C. Regalado, D. Kline, P. Araman. “Optimum edging and trimming of hardwood lumber”. Forest Products Journal. Vol. 42. 1992. pp. 8-14.
D. Schmoldt, H. Song, P. Araman. “Real time Value Optimization of Edging and Trimming Operations for rough, Green Hardwood Lumber”. Proceedings of ScanTech 2001 International Conference. Seattle (Washington). 2001. pp. 87-99.
W. Pastorius. “Optimization in lumber industry, Laser Scanning”. Documento Técnico. Ed. LMI Technologies Inc. Ontario (Canadá). 2000. pp. 1-5.
H. Song. An Accurate and Efficient Algorithm for edging trimming Optimization. Master of Science Thesis. Biological System Engineering. University of Wisconsin Madison (Wisconsin). 2001. pp. 1-120.
C. L. Todoroki, E. M. Ronnqvist. “Secondary log breakdown optimization with dynamic programming”. Journal of the Operational Research Society. Vol. 48. 1997. pp. 471-478.
A. Elmaghraby, E. Abdelhafiz, M. Hassan. An Intelligent Approach to Stock Cutting Optimization.
MsC. Thesis. Univ. of Louisville. Louisville (KY)m2001. pp. 1-4.
A. Provedel, A. Gómes, V. Parada. “Una Contribución al Problema de Corte de Piezas en la Industria Textil”. Revista Latinoamericana de Tecnología Textil. Vol. 1. 1997. pp. 57-63.
G. De Puy, R. Moraga, G. Whitehouse. “Meta- RaPS: A Simple and Effective Approach For Solving The Traveling Salesman Problem”. Transportation Research Part E: Logistics and Transportation Review. Vol. 41. 2005. pp. 115-130
W. Benfold, M. Manfrin, A. Rodrigues, S. Spinella. “A Genetic Algorithm for 2D Glass Cutting Problem”. IRIDIA Technical Report Series. Vol. 13. 2005. pp. 1-9.
E. Burke, G. Kendall, G. Whitwell. “A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem”. Journal on Computing. Vol. 21. 2009. pp. 505-516.
D. Zhang, Y. Kang, A. Deng. “A new heuristic recursive algorithm for the strip rectangular packing problem” Computers and Operations Research. Vol. 33. 2006. pp. 2209-2217.
D. Zhang, S. Han, W. Ye. “A bricklaying heuristic algorithm for the orthogonal rectangular packing problem” Chinese Journal of Computers. Vol. 23. 2008. pp. 509-515.
A. Bortfeldt. “A genetic algorithm for the twodimensional strip packing problem with rectangular
pieces”. European Journal of Operational Research. Vol. 172. 2006. pp. 814-837.
S. Leung, Z. Defu. “A New Heuristic Approach for the Stock-Cutting Problems”. Proceedings of World Academy of Science, Engineering & Technology. Vol. 41. 2009. pp. 688-693.
J. Oliveira, G. Wäscher. “Cutting and Packing” European Journal of Operational Research. Vol. 183. 2007. pp. 1106-1108.
Soderhamn Eriksson. Programa versión 3.x Edgar Sistema de escaneo y optimización. Manual Técnico. Soderhams (Suecia). 1997. pp. 1-155.
How to Cite
Copyright (c) 2018 Revista Facultad de Ingeniería
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Revista Facultad de Ingeniería, Universidad de Antioquia is licensed under the Creative Commons Attribution BY-NC-SA 4.0 license. https://creativecommons.org/licenses/by-nc-sa/4.0/deed.en
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial — You may not use the material for commercial purposes.
ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
The material published in the journal can be distributed, copied and exhibited by third parties if the respective credits are given to the journal. No commercial benefit can be obtained and derivative works must be under the same license terms as the original work.