Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Nascimento et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: