No abstract

This paper presents an improvement of heuristic placement algorithm for solving two-dimensional knapsack packing problem. The packing patterns were enhanced by modifying the packing rules. This approach can increase the feasibility for packing more suitable items to a container while also preserves the advantages of rules greediness. The total average percentage of trim loss is reduced nearly 15 percent in comparison with the original algorithm on 211 instances from 9 benchmark datasets.