Abbasi, J., Sahir, M. Development of Optimal Cutting Plan using Linear Programming Tools and MATLAB Algorithm – Int. J. of Innovation, Management and Technology, Vol. 1, No. 5, pp.483-492, 2010.
Alba, E., & Tomassini, M. (2002). Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5), 443-462. doi:10.1109/tevc.2002.800880
Albano, A. (1977). A method to improve two-dimensional layout. Computer-Aided Design, 9(1), 48-52. doi:10.1016/0010-4485(77)90062-8
[+]
Abbasi, J., Sahir, M. Development of Optimal Cutting Plan using Linear Programming Tools and MATLAB Algorithm – Int. J. of Innovation, Management and Technology, Vol. 1, No. 5, pp.483-492, 2010.
Alba, E., & Tomassini, M. (2002). Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5), 443-462. doi:10.1109/tevc.2002.800880
Albano, A. (1977). A method to improve two-dimensional layout. Computer-Aided Design, 9(1), 48-52. doi:10.1016/0010-4485(77)90062-8
ASNS - Nesting Software For Optimum Use Of Materials, LLC Technos, 2013.
Baker, B. S., Coffman, Jr., E. G., & Rivest, R. L. (1980). Orthogonal Packings in Two Dimensions. SIAM Journal on Computing, 9(4), 846-855. doi:10.1137/0209064
Chazelle. (1983). The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation. IEEE Transactions on Computers, C-32(8), 697-707. doi:10.1109/tc.1983.1676307
Cheng, C. ., Feiring, B. ., & Cheng, T. C. . (1994). The cutting stock problem — a survey. International Journal of Production Economics, 36(3), 291-305. doi:10.1016/0925-5273(94)00045-x
Cheng, S. K., & Rao, K. P. (2000). Large-scale nesting of irregular patterns using compact neighborhood algorithm. Journal of Materials Processing Technology, 103(1), 135-140. doi:10.1016/s0924-0136(00)00402-7
Cui, Y., He, D., & Song, X. (2006). Generating optimal two-section cutting patterns for rectangular blanks. Computers & Operations Research, 33(6), 1505-1520. doi:10.1016/j.cor.2004.09.022
Dagli,C. Cutting Stock Problem: Combined Use of Heuristics and Optimization Methods, Recent Developments in Production Research Amsterdam, pp. 500-506, 1988. Dowsland, K.A., Vaid, S., Dowsland, W.B. An Algorithm for Polygon Placement Using a Bottom-left Strategy, European Journal of Operational Research, 141:371-381, 2002.
Elkeran, A. (2013). A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. European Journal of Operational Research, 231(3), 757-769. doi:10.1016/j.ejor.2013.06.020
Hifi, M. (2001). Computational Optimization and Applications, 18(1), 63-88. doi:10.1023/a:1008743711658
Hopper, E., & Turton, B. (1999). A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering, 37(1-2), 375-378. doi:10.1016/s0360-8352(99)00097-2
Hopper, E., & Turton, B. C. . (2001). An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128(1), 34-57. doi:10.1016/s0377-2217(99)00357-4
Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1), 165-181. doi:10.1016/0377-2217(94)00166-9
Junior, B.A., Pinheiro, P.R., Saraiva, R.D. A Hybrid Methodology for Nesting Irregular Shape: Case Study on a Textile Industry, 6th IFAC Conference on M. and Control of Production and Logistics (Brazil), pp.15-20, 2013.
Lai, K. K., & Chan, J. W. M. (1997). Developing a simulated annealing algorithm for the cutting stock problem. Computers & Industrial Engineering, 32(1), 115-127. doi:10.1016/s0360-8352(96)00205-7
Lee, W.-C., Ma, H., & Cheng, B.-W. (2008). A heuristic for nesting problems of irregular shapes. Computer-Aided Design, 40(5), 625-633. doi:10.1016/j.cad.2008.02.008
Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2005). New heuristic and interactive approaches to 2D rectangular strip packing. ACM Journal of Experimental Algorithmics, 10. doi:10.1145/1064546.1083322
Lesh, N., & Mitzenmacher, M. (2006). BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters, 97(4), 161-169. doi:10.1016/j.ipl.2005.08.013
Liu, D., & Teng, H. (1999). An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research, 112(2), 413-420. doi:10.1016/s0377-2217(97)00437-2
OFA - Optimizer For Anyshape - Samtec Solutions - Website http://www.samtecsolutions.com/.
Parada Daza, V., Gómes de Alvarenga, A., & de Diego, J. (1995). Exact solutions for constrained two-dimensional cutting problems. European Journal of Operational Research, 84(3), 633-644. doi:10.1016/0377-2217(95)00028-o
Rodrigo, W., Daundasekera, W. and Perera A. Pattern Generation for Two Dimensional Cutting Stock Problem - International Journal of Mathematics Trends and Technology, 3(2), pp.54-62, 2012.
Ross, P., Schulenburg, S., Marín-Blázquez, J.G., & Hart, E. Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In LNCS. Conference on genetic and evolutionary computation, pp. 942-948, 2002.
Savio, G., Menneghello, R., Conceri, G. A Heuristic Approach for Nesting of 2D Shapes, in: Proceedings of the 37th Int. MATADOR Conference (Springer), pp.49-53, 2012.
Siasos, A., & Vosniakos, G.-C. (2014). Optimal directional nesting of planar profiles on fabric bands for composites manufacturing. CIRP Journal of Manufacturing Science and Technology, 7(3), 283-297. doi:10.1016/j.cirpj.2014.06.001
Tay, F. E. H., Chong, T. Y., & Lee, F. C. (2002). Pattern nesting on irregular-shaped stock using Genetic Algorithms. Engineering Applications of Artificial Intelligence, 15(6), 551-558. doi:10.1016/s0952-1976(03)00009-5
Weng, W.-C., & Kuo, H.-C. (2011). Irregular stock cutting system based on AutoCAD. Advances in Engineering Software, 42(9), 634-643. doi:10.1016/j.advengsoft.2011.04.009
[-]