IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v179y2007i1p27-49.html
   My bibliography  Save this article

Complete and robust no-fit polygon generation for the irregular stock cutting problem

Author

Listed:
  • Burke, E.K.
  • Hellier, R.S.R.
  • Kendall, G.
  • Whitwell, G.

Abstract

No abstract is available for this item.

Suggested Citation

  • Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    • Handle: RePEc:eee:ejores:v:179:y:2007:i:1:p:27-49
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00163-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dowsland, Kathryn A. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
    2. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    3. Li, Zhenyu & Milenkovic, Victor, 1995. "Compaction and separation algorithms for non-convex polygons and their applications," European Journal of Operational Research, Elsevier, vol. 84(3), pages 539-561, August.
    4. Dowsland, Kathryn A. & Vaid, Subodh & Dowsland, William B., 2002. "An algorithm for polygon placement using a bottom-left strategy," European Journal of Operational Research, Elsevier, vol. 141(2), pages 371-381, September.
    5. Grinde, Roger B. & Cavalier, Tom M., 1995. "A new algorithm for the minimal-area convex enclosure problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 522-538, August.
    6. Gomes, A. Miguel & Oliveira, Jose F., 2002. "A 2-exchange heuristic for nesting problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 359-370, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juan Lu & Chengyi Ou & Chen Liao & Zhenkun Zhang & Kai Chen & Xiaoping Liao, 2021. "Formal modelling of a sheet metal smart manufacturing system by using Petri nets and first-order predicate logic," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1043-1063, April.
    2. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    3. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    4. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    5. J. Bennell & G. Scheithauer & Y. Stoyan & T. Romanova, 2010. "Tools of mathematical modeling of arbitrary object packing problems," Annals of Operations Research, Springer, vol. 179(1), pages 343-368, September.
    6. Qiang Luo & Yunqing Rao, 2022. "Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    7. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    8. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    9. Miguel Santoro & Felipe Lemos, 2015. "Irregular packing: MILP model based on a polygonal enclosure," Annals of Operations Research, Springer, vol. 235(1), pages 693-707, December.
    10. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    11. Jie Fang & Yunqing Rao & Xusheng Zhao & Bing Du, 2023. "A Hybrid Reinforcement Learning Algorithm for 2D Irregular Packing Problems," Mathematics, MDPI, vol. 11(2), pages 1-17, January.
    12. E. K. Burke & R. S. R. Hellier & G. Kendall & G. Whitwell, 2010. "Irregular Packing Using the Line and Arc No-Fit Polygon," Operations Research, INFORMS, vol. 58(4-part-1), pages 948-970, August.
    13. Huang, Zhendong & Xiao, Renbin, 2013. "An emergent computation approach to the problem of polygon layout with performance constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5074-5088.
    14. Qin, Yichen & Ng, Kam K.H., 2023. "Analysing the impact of collaborations between airlines and maintenance service company under MRO outsourcing mode: Perspective from airline's operations," Journal of Air Transport Management, Elsevier, vol. 109(C).
    15. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    16. Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.
    17. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    18. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2019. "Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues," European Journal of Operational Research, Elsevier, vol. 273(1), pages 288-304.
    19. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    20. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.
    21. Donald Jones, 2014. "A fully general, exact algorithm for nesting irregular shapes," Journal of Global Optimization, Springer, vol. 59(2), pages 367-404, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    2. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    3. E G Birgin & J M Martínez & W F Mascarenhas & D P Ronconi, 2006. "Method of sentinels for packing items within arbitrary convex regions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 735-746, June.
    4. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    5. Dickinson, John K. & Knopf, George K., 2000. "A moment based metric for 2-D and 3-D packing," European Journal of Operational Research, Elsevier, vol. 122(1), pages 133-144, April.
    6. Egeblad, Jens & Nielsen, Benny K. & Odgaard, Allan, 2007. "Fast neighborhood search for two- and three-dimensional nesting problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1249-1266, December.
    7. Elkeran, Ahmed, 2013. "A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering," European Journal of Operational Research, Elsevier, vol. 231(3), pages 757-769.
    8. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    9. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    10. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    11. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    12. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    13. E G Birgin & R D Lobato & R Morabito, 2010. "An effective recursive partitioning approach for the packing of identical rectangles in a rectangle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 306-320, February.
    14. Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
    15. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, January.
    16. Stoyan, Yu. G. & Novozhilova, M. V. & Kartashov, A. V., 1996. "Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 193-210, July.
    17. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    18. Yu, M.T. & Lin, T.Y. & Hung, C., 2009. "Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons," International Journal of Production Economics, Elsevier, vol. 121(1), pages 148-161, September.
    19. Edmund K. Burke & Graham Kendall & Glenn Whitwell, 2009. "A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 505-516, August.
    20. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:179:y:2007:i:1:p:27-49. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.