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: | , , , |
|---|---|
| 格式: | Conference Proceeding |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84958245744&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54315 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |
| id |
th-cmuir.6653943832-54315 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-543152018-09-04T10:11:46Z Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem Kanokwatt Shiangjen Jeerayut Chaijaruwanich Wijak Srisujjalertwaja Samerkae Somhom Computer Science © 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. 2018-09-04T10:11:46Z 2018-09-04T10:11:46Z 2015-11-25 Conference Proceeding 23270594 23270586 2-s2.0-84958245744 10.1109/ICSESS.2015.7339001 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84958245744&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54315 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Computer Science |
| spellingShingle |
Computer Science Kanokwatt Shiangjen Jeerayut Chaijaruwanich Wijak Srisujjalertwaja Samerkae Somhom Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| description |
© 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. |
| format |
Conference Proceeding |
| author |
Kanokwatt Shiangjen Jeerayut Chaijaruwanich Wijak Srisujjalertwaja Samerkae Somhom |
| author_facet |
Kanokwatt Shiangjen Jeerayut Chaijaruwanich Wijak Srisujjalertwaja Samerkae Somhom |
| author_sort |
Kanokwatt Shiangjen |
| title |
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| title_short |
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| title_full |
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| title_fullStr |
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| title_full_unstemmed |
Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| title_sort |
enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84958245744&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54315 |
| _version_ |
1681424298087022592 |