Solving bin Packing Problem with a Hybrid Genetic Algorithm for VM Placement in Cloud

AbstractThe Bin Packing Problem's purpose (BPP) is to find the minimum number of bins needed to pack a given set of objects of known sizes so that they do not exceed the capacity of each bin. This problem is known to be NP- Hard. In this paper, we propose an hybrid genetic algorithm using BFD (Best Fit Decreasing) to deal with infeasible solution due to the bin-used representation. Experimental results showed the effectiveness of our approach for infeasible chromosomes thereby improving the quality of the obtained solution. This will give a good result for the virtual machine placement in Cloud to minimize energy since it looks like a BPP