IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_43.html
   My bibliography  Save this book chapter

Cutting and Packing

In: Handbook of Heuristics

Author

Listed:
  • Ramón Alvarez-Valdes

    (Universitat de València)

  • Maria Antónia Carravilla

    (University of Porto, INESC TEC and Faculty of Engineering)

  • José Fernando Oliveira

    (University of Porto, INESC TEC and Faculty of Engineering)

Abstract

Cutting and Packing (C&P) problems arise in many industrial and logistic applications, whenever a set of small items, with different shapes, has to be assigned to large objects with specific shapes so as to optimize some objective function. Besides some characteristics common to combinatorial optimization problems, the distinctive feature of this field is the existence of a geometric subproblem, to ensure that the items do not overlap and are completely contained in the large objects. The geometric tools required to deal with this subproblem depend on the shapes (rectangles, circles, irregular) and on the specific conditions of the problem being solved. In this chapter, after an introduction that describes and classifies Cutting and Packing problems, we review the basic strategies that have appeared in the literature for designing constructive algorithms, local search procedures, and metaheuristics for problems with regular and irregular shapes.

Suggested Citation

  • Ramón Alvarez-Valdes & Maria Antónia Carravilla & José Fernando Oliveira, 2025. "Cutting and Packing," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 39, pages 1219-1268, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_43
    DOI: 10.1007/978-3-032-00385-0_43
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-032-00385-0_43. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.