lspack: a local search approach for Packing Problems (OPP, SPP)
Stéphane Grandcolas - Cyril Pain-Barre "Une métaheuristique pour les problèmes de packing orthogonal en deux dimensions", Actes JFPC 2016, juin 2016 (pdf).
Stéphane Grandcolas - Cyril Pain-Barre "A hybrid metaheuristic for the two-dimensional strip packing problem", Annals of Operations Research, 2021, DOI 10.1007/s10479-021-04226-6.
Download: lspack for PC x86_64 on Linux (2020 version).
Try -help for the full list of options and parameters.
Random instances: various sizes
Instances with 30 to 80 items, sizes from 400 to 1000, areas less than 400000. Download instances.An example with 60 items:
Random instances: various shapes
Instances with 50 items, 6 series with various constraints on items shapes.. Download instances.
gcut13r solution height=4986
The problem is to pack a set of 32 items in a strip of width 3000 (for more information see J. E. Beasley. "Algorithms for unconstrained two-dimensional guillotine cutting", The Journal of the Operational Research Society, 36(4) :297–306, 1985). |