We investigate the 2D guillotine knapsack packing problem, where the objective is to select and pack a set of rectangles into a sheet with fix size and maximize the total profit of packed rectangles. We combine well known two methods namely top-down approach and bottom-up approach into a coherent algorithm to address this problem. Computational experiments on benchmark test sets show that our approach could find optimal solution for almost all the instances with moderate size and outperform all existing approaches for the larger instances. © 2013 Springer-Verlag.
CITATION STYLE
Wei, L., Lim, A., & Zhu, W. (2013). A bidirectional building approach for the 2D guillotine knapsack packing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7906 LNAI, pp. 232–241). https://doi.org/10.1007/978-3-642-38577-3_24
Mendeley helps you to discover research relevant for your work.