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

DOI10.1016/j.ejor.2016.03.009zbMath1346.90626OpenAlexW2294646594MaRDI QIDQ323210

Luiz H. Cherri, Marina Andretta, Maria Antónia Carravilla, Franklina Maria Bragion Toledo, José Fernando Oliveira, Leandro Resende Mundim

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.009

zbMATH Keywords

packingcuttingnestingMIP models

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (19)

Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ A genetic algorithm for optimizing space utilization in aircraft hangar shop ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Product packing and stacking under uncertainty: a robust approach ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Irregular packing problems: a review of mathematical models ⋮ Near optimal minimal convex hulls of disks ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Raster penetration map applied to the irregular packing problem

Cites Work

• Algorithms for nesting with defects
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• Mixed-integer programming models for nesting problems
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• An Exact Approach to the Strip-Packing Problem
• Solving the irregular strip packing problem via guided local search for overlap minimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Robust mixed-integer linear programming models for the irregular strip packing problem