Two‐dimensional irregular strip packing problem under demand uncertainty via two‐stage stochastic programming

Abstract This paper addresses the two‐dimensional irregular strip packing problem with demand uncertainty and strip length defined in the first stage, which models a rigid supply environment where the strip length must be committed to “here‐and‐now.” We propose a novel two‐stage stochastic programming formulation featuring a “fictitious‐strip” mechanism to penalize unmet demand within the fixed boundaries geometrically. Because exact resolution via commercial solvers proves highly intractable, we develop a constructive heuristic and a biased random‐key genetic algorithm to solve large‐scale instances of the problem. The solution quality and scenario stability are validated through an incremental, nested sampling scheme that successfully identifies convergence plateaus of the objective function. Computational experiments based on benchmark instances and a large number of scenarios reveal promising values for the expected value of perfect information and the value of the stochastic solution, also highlighting the great scalability of our solution method.

Authors

Institutions

Publication Details

Journal
International Transactions in Operational Research
Published
2026-11-16
DOI
https://doi.org/10.1111/itor.70299
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Two‐dimensional irregular strip packing problem under demand uncertainty via two‐stage stochastic programming

Marina Andretta, Douglas Alem, Oliviana Xavier do Nascimento
International Transactions in Operational Research
Optimization and Packing Problems
article

Two‐dimensional irregular strip packing problem under demand uncertainty via two‐stage stochastic programming

Marina Andretta, Douglas Alem, Oliviana Xavier do Nascimento
article en

Abstract

Abstract This paper addresses the two‐dimensional irregular strip packing problem with demand uncertainty and strip length defined in the first stage, which models a rigid supply environment where the strip length must be committed to “here‐and‐now.” We propose a novel two‐stage stochastic programming formulation featuring a “fictitious‐strip” mechanism to penalize unmet demand within the fixed boundaries geometrically. Because exact resolution via commercial solvers proves highly intractable, we develop a constructive heuristic and a biased random‐key genetic algorithm to solve large‐scale instances of the problem. The solution quality and scenario stability are validated through an incremental, nested sampling scheme that successfully identifies convergence plateaus of the objective function. Computational experiments based on benchmark instances and a large number of scenarios reveal promising values for the expected value of perfect information and the value of the stochastic solution, also highlighting the great scalability of our solution method.

International Transactions in Operational Research
Universidade de São Paulo (BR), Universidade Federal de Goiás (BR), University of Edinburgh (GB)
Fundação de Amparo à Pesquisa do Estado de São Paulo, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon