Cutting and packing

• Type: Chapter or Part of a Book
• Date: 2018

Authors

Ramón Alvarez-Valdes (Author) Other; Maria Antónia Carravilla (Author) FEUP; José Fernando Oliveira (Author) FEUP

Book

Title: Handbook of Heuristics

Pages: 931-977

ISBN: 9783319071244; 9783319071237

Indexing

Scopus - 2 Citations

Other information

Authenticus ID: P-00Q-CB1

DOI: 10.1007/978-3-319-07124-4_43

Abstract (EN): Cutting and Packing (C & P) problems arise in many industrial and logistics 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 47