A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics

Abstract

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.

Authors and Affiliations

Debajit Sensarma, Samar Sen Sarma

Keywords

Related Articles

A Review on Event-Based Epidemic Surveillance Systems that Support the Arabic Language

With the revolution of the internet, many event-based systems have been developed for monitoring epidemic threats. These systems rely on unstructured data gathered from various online sources. Moreover, some systems are...

Evolutionary Algorithms Based on Decomposition and Indicator Functions: State-of-the-art Survey

In the last two decades, multiobjective optimization has become mainstream because of its wide applicability in a variety of areas such engineering, management, the military and other fields. Multi-Objective Evolutionary...

A Novel Approach for Dimensionality Reduction and Classification of Hyperspectral Images based on Normalized Synergy

During the last decade, hyperspectral images have attracted increasing interest from researchers worldwide. They provide more detailed information about an observed area and allow an accurate target detection and precise...

Robust Face Detection Using Circular Multi Block Local Binary Pattern and Integral Haar Features 

In real world applications, it is very challenging to implement a good detector which gives best performance with great speed and accuracy. There is always a trade-off in terms of speed and accuracy, when we consider per...

Improvement of Control System Performance by Modification of Time Delay

This paper presents a mathematical approach for improving the performance of a control system by modifying the time delay at certain operating conditions. This approach converts a continuous time loop into a discrete tim...

Download PDF file
  • EP ID EP249026
  • DOI 10.14569/IJACSA.2017.080205
  • Views 89
  • Downloads 0

How To Cite

Debajit Sensarma, Samar Sen Sarma (2017). A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics. International Journal of Advanced Computer Science & Applications, 8(2), 29-39. https://europub.co.uk/articles/-A-249026