A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics
نویسندگان
چکیده
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. Keywords—Bin Packing; Combinatorial Optimization; Graph Theory; Heuristics; Operational Research
منابع مشابه
Heuristics for Solving the Bin-Packing Problem with Conflicts
This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to packing items of maximal-stable-subsets ...
متن کاملA genetic programming hyper-heuristic approach to automated packing
This thesis presents a programme of research which investigated a genetic programming hyper-heuristic methodology to automate the heuristic design process for one, two and three dimensional packing problems. Traditionally, heuristic search methodologies operate on a space of potential solutions to a problem. In contrast, a hyper-heuristic is a heuristic which searches a space of heuristics, rat...
متن کاملA novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem
Bin packing is a well-known NP-Hard optimization problem which has several real applications. Classical bin packing (BPP) is a simple model where all bins are identical. However, the variable sized bin packing problem (VSBPP) is a generalization of the bin packing problem where bins of different capacities are available for packing a set of items having different weights. The objective is to pa...
متن کاملEfficient Heuristics for the Variable Size Bin Packing Problem with Fixed Costs
We consider the Variable Size Bin Packing Problem with Fixed Costs, a generalization of the well-known bin packing problem where a set of items must be packed within a set of heterogeneous bins characterized by possibly different volumes and fixed costs. The objective of the problem is to select the bins to pack all items while minimizing the total cost incurred for the selected bins. We presen...
متن کاملA new lower bound for bin-packing problem with general conflicts graph
We propose a new lower bound for the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. The lower bound is based on an iterative search of maximal cliques in the conflict graph using Johnson's heuristic. At each step we delete from the graph the items of the last clique fo...
متن کامل