Irregular Packing Using the Line and Arc No-Fit Polygon

References

• Albano A., Sapuppo G. Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Systems, Man and Cybernetics (1980) SMC-10:242–248Crossref, Google Scholar
• Bennell J., Scheithauer G., Stoyan Y., Romanova T. Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. (2008) . ePub ahead of print November 9Google Scholar
• Bennell J. A., Oliveira J. F. The geometry of nesting problems: A tutorial. Eur. J. Oper. Res. (2008) 184:397–415Crossref, Google Scholar
• Bennell J. A., Song X. A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. (2008) 35(1):267–281Crossref, Google Scholar
• Bennell J. A., Dowsland K. A., Dowsland W. B. The irregular cutting-stock problem—A new procedure for deriving the no-fit polygon. Comput. Oper. Res. (2001) 28(3):271–287Crossref, Google Scholar
• Blazewicz J., Hawryluk P., Walkowiak R., Glover F., Laguna M., de Werra T. E. Using a tabu search approach for solving the two-dimensional irregular cutting problem. Tabu Search. Annals of Operations Research (1993) 41(J. C. Baltzer AG, Science Publishers, Red Bank, NJ) 313–325Crossref, Google Scholar
• Bounsaythip C., Maouche S. Irregular shape nesting and placing with evolutionary approach. Proc. IEEE Internat. Conf. Systems, Man and Cybernetics (1997) 4:3425–3430Crossref, Google Scholar
• Burke E. K., Hellier R. S. R., Kendall G., Whitwell G. A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. (2006) 54(3):587–601Link, Google Scholar
• Burke E. K., Hellier R. S. R., Kendall G., Whitwell G. Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. (2007) 179(1):27–49Crossref, Google Scholar
• Cunninghame-Green R. Geometry, shoemaking and the milk tray problem. New Scientist (1989) 1677:50–53Google Scholar
• Cunninghame-Green R., Davis L. S. Cut out waste! O.R. Insight (1992) 5(3):4–7Crossref, Google Scholar
• Dighe R., Jakiela M. J. Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection. Evolutionary Comput. (1996) 3:239–266Crossref, Google Scholar
• Dowsland K. A., Dowsland W. B., Bennell J. A. Jostling for position—Local improvement for irregular cutting patterns. J. Oper. Res. Soc. (1998) 49(6):647–658Crossref, Google Scholar
• Fujita K., Akagji S., Kirokawa N. Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm. Proc. 19th Annual ASME Design Automation Conf. (1993) 65Albuquerque, NM(ASME, New York) 477–484Part 1Google Scholar
• Garey M., Johnson D.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Ghosh P. An algebra of polygons through the notion of negative shapes. CVGIP: Image Understanding (1991) 54(1):119–144Crossref, Google Scholar
• Gomes A. M., Oliveira J. F. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. (2006) 171(3):811–829Crossref, Google Scholar
• Hopper E. Two dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. (2000) . Ph.D. thesis, University of Wales, CardiffGoogle Scholar
• Huyao L., Yuanjun H., Bennell J. A. The irregular nesting problem: A new approach for no-fit polygon calculation. J. Oper. Res. Soc. (2007) 58:1235–1245Crossref, Google Scholar
• Jakobs S. On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. (1996) 88:165–181Crossref, Google Scholar
• Kendall G. Applying meta-heuristic algorithms to the nesting problem utilising the no-fit polygon. (2000) . Ph.D. thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, UKGoogle Scholar
• Mahadevan A. Optimisation in computer aided pattern packing. (1984) . Ph.D. thesis, North Carolina State University, Raleigh, NCGoogle Scholar
• Marques V. M. M., Bispo C. F. G., Sentieiro J. J. S. A system for the compaction of two-dimensional irregular shapes based on simulated annealing. Proc. 1991 Internat. Conf. Indust. Electronics, Control and Instrumentation—IECON'91 (1991) 99(Kobe, Japan) 1911–1916Crossref, Google Scholar
• Oliveira J. F., Ferreira J. S. Algorithms for nesting problems. Applied Simulated Annealing (1993) (Springer-Verlag, Berlin) 255–273Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Oliveira J. F., Gomes A. M., Ferreira J. S. A new constructive algorithm for nesting problems. OR Spektrum (2000) 22:263–284Crossref, Google Scholar
• Ratanapan K., Dagli C. H. An object-based evolutionary algorithm for solving irregular nesting problems. Proc. Artificial Neural Networks Engrg. Conf. (ANNIE'97) (1997) 7(ASME Press, New York) 383–388Google Scholar
• Wäscher G., Haußner H., Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183(3):1109–1130Crossref, Google Scholar