Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Kanokwatt Shiangjen, Jeerayut Chaijaruwanich, Wijak Srisujjalertwaja, Samerkae Somhom
Format: Conference Proceeding
Published: 2018
Subjects:
Agricultural and Biological Sciences
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84958245744&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/44059
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-44059
record_format dspace
spelling th-cmuir.6653943832-440592018-04-25T07:45:13Z Enhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problem Kanokwatt Shiangjen Jeerayut Chaijaruwanich Wijak Srisujjalertwaja Samerkae Somhom Agricultural and Biological Sciences © 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-01-24T04:37:37Z 2018-01-24T04:37:37Z 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/44059
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Agricultural and Biological Sciences
spellingShingle Agricultural and Biological Sciences
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/44059
_version_ 1681422489085804544

Similar Items