IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/548957.html
   My bibliography  Save this article

Dealing with Nonregular Shapes Packing

Author

Listed:
  • Bonfim Amaro Júnior
  • Plácido Rogério Pinheiro
  • Rommel Dias Saraiva
  • Pedro Gabriel Calíope Dantas Pinheiro

Abstract

This paper addresses the irregular strip packing problem, a particular two-dimensional cutting and packing problem in which convex/nonconvex shapes (polygons) have to be packed onto a single rectangular object. We propose an approach that prescribes the integration of a metaheuristic engine (i.e., genetic algorithm) and a placement rule (i.e., greedy bottom-left). Moreover, a shrinking algorithm is encapsulated into the metaheuristic engine to improve good quality solutions. To accomplish this task, we propose a no-fit polygon based heuristic that shifts polygons closer to each other. Computational experiments performed on standard benchmark problems, as well as practical case studies developed in the ambit of a large textile industry, are also reported and discussed here in order to testify the potentialities of proposed approach.

Suggested Citation

  • Bonfim Amaro Júnior & Plácido Rogério Pinheiro & Rommel Dias Saraiva & Pedro Gabriel Calíope Dantas Pinheiro, 2014. "Dealing with Nonregular Shapes Packing," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-10, July.
    • Handle: RePEc:hin:jnlmpe:548957
    DOI: 10.1155/2014/548957
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/548957.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/548957.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/548957?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. 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.

    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:hin:jnlmpe:548957. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.