文章基本信息

标题：A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics
本地全文：下载
作者：Debajit Sensarma ; Samar Sen Sarma
期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2017
卷号：8
期号：2
DOI：10.14569/IJACSA.2017.080205
出版社：Science and Information Society (SAI)
摘要：In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the “Bin Packing Problem” where bins represent available storage space and the problem is to store the items or data in minimum number of bins. This research work mainly focuses on to find a near optimal solution of the offline one dimensional Bin Packing Problem based on two heuristics by taking the advantages of graph. Additionally, extreme computational results on some benchmark instances are reported and compared with the best known solution and solution produced by the four other well-known bin oriented heuristics. Also some future directions of the proposed work have been depicted.
关键词：thesai; IJACSA Volume 8 Issue 2; Bin Packing; Combinatorial Optimization; Graph Theory; Heuristics; Operational Research