Framework of algorithm portfolios for strip packing problem

In this paper selection of fast algorithm portfolios for 2SP packing problem is considered. The 2SP problem consists in placing rectangles on a strip of the given width for minimum strip length. The 2SP packing has application in many industries, but suitability of the related algorithms is limited...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 172; H. part A; S. 108538
Hauptverfasser:	Piechowiak, Kamil, Drozdowski, Maciej, Sanlaville, Éric
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.10.2022 Elsevier
Schlagworte:	2D packing Algorithm portfolios Algorithm selection problem Computer Science Heuristics Mathematics Runtime-quality trade-off Algorithm portfolios 2D packing Runtime-quality trade-off Heuristics Algorithm selection problem algorithm portfolios algorithm selection problem runtime-quality trade-off
ISSN:	0360-8352, 1879-0550
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!