Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKanokwatt Shiangjenen_US
dc.contributor.authorJeerayut Chaijaruwanichen_US
dc.contributor.authorWijak Srisujjalertwajaen_US
dc.contributor.authorSamerkae Somhomen_US
dc.description.abstract© 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.en_US
dc.subjectComputer Scienceen_US
dc.titleEnhancing the efficiency of heuristic placement algorithm for two-dimensional orthogonal knapsack packing problemen_US
dc.typeConference Proceedingen_US
article.title.sourcetitleProceedings of the IEEE International Conference on Software Engineering and Service Sciences, ICSESSen_US
article.volume2015-Novemberen_US Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.

Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.