Abstract
The research is motivated by a nesting problem in a CNC router machine in a metalworking company, where efficient cutting patterns are desired in order to minimize metal sheets. In the routing process under study, the metal sheets vary in size, the material leftovers after cutting may be used again, and the machine can cut the sheets in stacks simultaneously. This paper reports the development of an efficient algorithm to solve problems with such combined characteristics. It is based on the Best Fit algorithm with a multi-start strategy. A numerical example is provided to demonstrate the algorithm. It is found that the algorithm can find a good solution with 10.06% difference from the optimum in a quick time despite the relatively simple procedure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Andrade R, Birgin EG, Morabito R, dan Ronconi DP (2014) MIP models for two-dimensional non-guillotine cutting problems with usable leftovers. J Oper Res Soc 65(11):1649–1663
Aribowo W, dan Ali I (2021) An optimization model of variable size two-dimensional nesting with stacked sheets and usable leftovers for the CNC routing process. J Phys: Conf Ser 1858(1):012043
Chen M, Wu C, Tang X, Peng X, Zeng Z, dan Liu S (2019) An efficient deterministic heuristic algorithm for the rectangular packing problem. Comput Ind Eng 137:106097
Leung SC, dan Zhang D (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst with Appl 38(10):13032–13042
Liu Y, Chu C, dan Wang K (2011) A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem. Int J Prod Res 49(13):3815–3831
Resende MG, Martà R, dan Panos P (2017) Handbook of heuristics
Sumetthapiwat S, Intiyot B, dan Jeenanunta C (2020) A column generation on two-dimensional cutting stock problem with fixed-size usable leftover and multiple stock sizes. Int J Logist Syst Manag 35(2):273–288
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ali, I., Aribowo, W., Sukoyo (2023). Best-Fit Heuristic Algorithm for Multi-stack Rectangular Packing Problem of NC Router Machine. In: Rosyidi, C.N., Laksono, P.W., Jauhari, W.A., Hisjam, M. (eds) Proceedings of the 6th Asia Pacific Conference on Manufacturing Systems and 4th International Manufacturing Engineering Conference. iMEC-APCOMS 2022. Lecture Notes in Mechanical Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-99-1245-2_47
Download citation
DOI: https://doi.org/10.1007/978-981-99-1245-2_47
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-1244-5
Online ISBN: 978-981-99-1245-2
eBook Packages: EngineeringEngineering (R0)