Robust mixed-integer linear programming models for the irregular strip packing problem

•Two new nesting MIP models are proposed, compared and assessed.•Direct geometry and no-fit-polygon convex decomposition are used.•General models as they easily support pieces with complex geometries.•Easier to implement than previous models in the literature.•Outperform the best exact approach know...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 253; no. 3; pp. 570 - 583
Main Authors:	Cherri, Luiz H., Mundim, Leandro R., Andretta, Marina, Toledo, Franklina M.B., Oliveira, José F., Carravilla, Maria Antónia
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.09.2016 Elsevier Sequoia S.A
Subjects:	Algorithms Cutting Cutting stock problem Geometry Handling Heuristic Integer programming Linear programming Mathematical models MIP models Nesting Operational research Optimization algorithms Packing Packing problem Polygons Strip Studies Nesting Cutting Packing MIP models
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!