Automatic layout of 2D free-form shapes based on geometric similarity feature searching and fuzzy matching

Israni, 1982, Two-dimensional cutting stock problem research: a review and a new rectangular layout algorithm, J Manuf Syst, 1, 169, 10.1016/S0278-6125(82)80027-7 Wäscher, 2007, An improved typology of cutting and packing problems, Eur J Oper Res, 183, 1109, 10.1016/j.ejor.2005.12.047 Sherif, 2014, Sequential optimization approach for nesting and cutting sequence in laser cutting, J Manuf Syst, 33, 624, 10.1016/j.jmsy.2014.05.011 Venkateswarlu, 2001, The trim-loss problem in a wooden container manufacturing company, J Manuf Syst, 20, 166, 10.1016/S0278-6125(01)80038-8 Leao, 2020, Irregular packing problems: a review of mathematical models, Eur J Oper Res, 282, 803, 10.1016/j.ejor.2019.04.045 Lee, 2019, Iterative two-stage hybrid algorithm for the vehicle lifter location problem in semiconductor manufacturing, J Manuf Syst, 51, 106, 10.1016/j.jmsy.2019.02.003 Griffiths, 2019, Cost-driven build orientation and bin packing of parts in Selective Laser Melting (SLM), Eur J Oper Res, 273, 334, 10.1016/j.ejor.2018.07.053 Zhang, 2016, Two-dimensional placement optimization for multi-parts production in additive manufacturing, Robot Comput Integr Manuf, 38, 102, 10.1016/j.rcim.2015.11.003 Hamada, 2019, Development of automatic nesting system for shipbuilding using the branch-and-bound method, J Mar Sci Technol, 24, 398, 10.1007/s00773-018-0559-x Jeong, 2018, An analysis of shipyard spatial arrangement planning problems and a spatial arrangement algorithm considering free space and unplaced block, Int J Adv Manuf Technol, 95, 4307, 10.1007/s00170-017-1525-1 M’Hallah, 2016, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, Int Trans Oper Res, 23, 321, 10.1111/itor.12104 Adamowicz, 1976, Nesting two-dimensional shapes in rectangular modules, Comput Des, 8, 27 Del Valle, 2012, Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape, Expert Syst Appl, 39, 12589, 10.1016/j.eswa.2012.05.025 Grinde, 1995, A new algorithm for the minimal-area convex enclosure problem, Eur J Oper Res, 84, 522, 10.1016/0377-2217(95)00020-Q Elkeran, 2013, A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering, Eur J Oper Res, 231, 757, 10.1016/j.ejor.2013.06.020 Bennell, 2001, The irregular cutting-stock problem — a new procedure for deriving the no-fit polygon, Comput Oper Res, 28, 271, 10.1016/S0305-0548(00)00021-6 Burke, 2007, Complete and robust no-fit polygon generation for the irregular stock cutting problem, Eur J Oper Res, 179, 27, 10.1016/j.ejor.2006.03.011 Oliveira, 2000, TOPOS – a new constructive algorithm for nesting problems, OR-Spektrum, 22, 263, 10.1007/s002910050105 Annamalai Vasantha, 2016, Crowdsourcing solutions to 2D irregular strip packing problems from Internet workers, Int J Prod Res, 54, 4104, 10.1080/00207543.2015.1102355 Bennell, 2009, A tutorial in irregular shape packing problems, J Oper Res Soc, 60, S93, 10.1057/jors.2008.169 Abeysooriya, 2018, Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation, Int J Prod Econ, 195, 12, 10.1016/j.ijpe.2017.09.014 Martinez-Sykora, 2017, Matheuristics for the irregular bin packing problem with free rotations, Eur J Oper Res, 258, 440, 10.1016/j.ejor.2016.09.043 Dean, 2006, An improved method for calculating the no-fit polygon, Comput Oper Res, 33, 1521, 10.1016/j.cor.2004.11.005 Huyao, 2007, The irregular nesting problem: a new approach for nofit polygon calculation, J Oper Res Soc, 58, 1235, 10.1057/palgrave.jors.2602255 Burke, 2010, Irregular packing using the line and arc no-fit polygon, Oper Res, 58, 948, 10.1287/opre.1090.0770 Fischetti, 2009, Mixed-integer programming models for nesting problems, J Heuristics, 15, 201, 10.1007/s10732-008-9088-9 Silva, 2010, An integer programming model for two- and three-stage two-dimensional cutting stock problems, Eur J Oper Res, 205, 699, 10.1016/j.ejor.2010.01.039 Bouganis, 2007, A vision-based intelligent system for packing 2-D irregular shapes, IEEE Trans Autom Sci Eng, 4, 382, 10.1109/TASE.2006.887158 Fischer, 2004, Employing subgroup evolution for irregular-shape nesting, J Intell Manuf, 15, 187, 10.1023/B:JIMS.0000018032.38317.f3 Mundim, 2017, A biased random key genetic algorithm for open dimension nesting problems using no-fit raster, Expert Syst Appl, 81, 358, 10.1016/j.eswa.2017.03.059 Qu, 1987, A nesting algorithm for irregular parts and factors affecting trim losses, Int J Prod Res, 25, 381, 10.1080/00207548708919848 Guo, 2019, Efficient free-form contour packing based on code matching strategy, IEEE Access, 7, 57917, 10.1109/ACCESS.2019.2914248 Freeman, 1961, 260 Nixon, 2012, Chapter 7 - object description, 343 Bergroth, 2000, 39 Sankoff, 2000, The early introduction of dynamic programming into computational biology, Bioinformatics, 16, 41, 10.1093/bioinformatics/16.1.41 Huang, 2007, Dynamic programming algorithms for the mosaic longest common subsequence problem, Inf Process Lett, 102, 99, 10.1016/j.ipl.2006.11.006 Guan, 2019, Multi-objective particle swarm optimization for multi-workshop facility layout problem, J Manuf Syst, 53, 32, 10.1016/j.jmsy.2019.09.004 D’Antonio, 2018, An integrated mathematical model for the optimization of hybrid product-process layouts, J Manuf Syst, 46, 179, 10.1016/j.jmsy.2017.12.003 Dowsland, 2002, An algorithm for polygon placement using a bottom-left strategy, Eur J Oper Res, 141, 371, 10.1016/S0377-2217(02)00131-5 Guo, 2015, Free-form contour packing based on material grid approximation and lowest-gravity-center methods, Expert Syst Appl, 42, 1864, 10.1016/j.eswa.2014.10.005 Liu, 2011, Heuristic algorithm based on the principle of minimum total potential energy (HAPE): a new algorithm for nesting problems, J Zhejiang Univ-Sci A, 12, 860, 10.1631/jzus.A1100038 Albano, 1980, Optimal allocation of two-dimensional irregular shapes using heuristic search methods, IEEE Trans Syst Man Cybernet, 10, 242, 10.1109/TSMC.1980.4308483 Burke, 2006, A new bottom-left-Fill heuristic algorithm for the two-dimensional irregular packing problem, Oper Res, 54, 587, 10.1287/opre.1060.0293