Nesting Problems: Exact and Heuristic Algorithms - Martínez, Antonio
46,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
23 °P sammeln
  • Broschiertes Buch

This book presents a new Mixed Integer Programming model for the 2-Dimensional Cutting and Packing problems involving irregular shapes. This model is used in order to develope a exact algorithm, a Branch and Cut algorithm, which is able to solve instances up to 16 pieces to optimality. On the other hand, there is proposed a Matheuristic algorithm which produce competitive results on problems with up to 99 pieces. Finally, we have developed a constructive procedure which produce the best known results in the 2-Dimensional Irregular Bin Packing problems with Guillotine Cuts.

Andere Kunden interessierten sich auch für
Produktbeschreibung
This book presents a new Mixed Integer Programming model for the 2-Dimensional Cutting and Packing problems involving irregular shapes. This model is used in order to develope a exact algorithm, a Branch and Cut algorithm, which is able to solve instances up to 16 pieces to optimality. On the other hand, there is proposed a Matheuristic algorithm which produce competitive results on problems with up to 99 pieces. Finally, we have developed a constructive procedure which produce the best known results in the 2-Dimensional Irregular Bin Packing problems with Guillotine Cuts.
Autorenporträt
Antonio Martinez studied Mathematics and Statistics at the University of Valencia. He has been researching in Cutting and Packing problems since 2009. In 2013 he finished his PhD developing exact and heuristics algorithms to solve 2D Cutting and Packing problems involving irregular pieces.