Comparison of neighborhood structures for the rectangulart two-dimensional strip packing problem

Abstract

Não inclui resumo

Abstract : This paper addresses the Two-Dimensional Strip Packing Problem (2D-SPP) under specific constraints, employing local search techniques to explore three distinct neighborhood structures: Switch, Switch/Swap, and Shift. Extensive testing was conducted to evaluate the performance of these neighborhood structures across various instance sizes. Results were analyzed using tables, pie charts, and graphs to provide a comprehensive comparison. The findings indicate that the Switch structure consistently delivered the least favorable outcomes. In contrast, the Switch/Swap neighborhood excelled in medium-sized instances, while the Shift structure demonstrated superior performance for larger instances, highlighting its effectiveness in handling more complex scenarios