Abstract
In this paper we have analysed the bin packing problem by applying Genetic Algorithm (GA). In this analysis we have represented the problem as an optimization problem and considered the objective function as fitness function for GA. The numerical results obtained from the GA indicate that the GA is robust and it yields better results when compared with the results obtained from other heuristics such as First Fit Decreasing (FFD) and Best Fit Decreasing (BFD)