科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper researches on 2D bins packing problems with guillotine-cut constraints. Four successful ideas are combined into a single coherent heuristic: (1) combining narrow items into a block and then packing it as a single item, (2) slicing the bin space into shelves and packing items shelf-by-shelf, (3) adopting value correction strategies of replacement and insertion, and (4) adopting shelf partitioning based on random numbers to guarantee the adversity of packing schemes. Computational experiments by benchmark test sets suggest that this approach rivals existing approaches in performance and owns the potential ability for application in the both patterns of RG and OG.
