Given a set of rectangular items and a strip of given width, we consider the problem of allocating all the items to a minimum height strip. We present a Tabu search algorithm, a genetic algorithm and we combine the two into a hybrid approach. The performance of the proposed al- gorithms is evaluated through extensive computational experiments on instances from the literature and on randomly generated instances.
Metaheuristic Algorithms for the Strip Packing Problem
MONACI, MICHELE
2003
Abstract
Given a set of rectangular items and a strip of given width, we consider the problem of allocating all the items to a minimum height strip. We present a Tabu search algorithm, a genetic algorithm and we combine the two into a hybrid approach. The performance of the proposed al- gorithms is evaluated through extensive computational experiments on instances from the literature and on randomly generated instances.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
