| Abstract: | We investigate the 2D guillotine knapsack packing problem, where the objective is to select and pack a set of rectangles into a sheet with fixed size and maximize the total profit of packed rectangles. We combine two well-known 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 solutions for almost all the instances with moderate size and outperform all existing approaches for the large instances. | |||
| Date: | 14 June 2013 | |||
| Time: | 10:30am - 11:00am | |||
| Speaker: |
Mr Wei Lijun PhD Student Department of Management Sciences City University of Hong Kong |
|||
| Venue: | Room P7537, e-Logistics Laboratory, Department of Management Sciences, 7/F, Academic 1 Purple Zone, City University of Hong Kong | |||
| Attachment(s): |
|
[ Back ]
