Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem
© 2015 IEEE. 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 al...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84958245744&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54315 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Summary: | © 2015 IEEE. 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. |
---|