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 algorithms is evaluated through extensive computational experiments on instances from the literature and on randomly generated instances.
Metaheuristic Algorithms for the Strip Packing Problem / Iori, Manuel; S., Martello; M., Monaci. - STAMPA. - 78:(2003), pp. 159-179. (Intervento presentato al convegno International Conference on Optimization and Industry tenutosi a AUSTRALIA nel 2001).
Metaheuristic Algorithms for the Strip Packing Problem
IORI, MANUEL;
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 algorithms is evaluated through extensive computational experiments on instances from the literature and on randomly generated instances.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
