African Buffalo Optimization for One Dimensional Bin Packing Problem

2. Bin Packing Problem

Bin Packing Problems are combinatorial grouping problems. They can be classified based on their dimension into: one dimensional, two dimensional, three dimensional and multi-dimensional Bin Packing problems. BPP appear in large practical optimization problems in real life and industrial applications including: logistics, manufacturing, wireless communication and engineering (Garey & Johnson, 1979; Fleszar, 2012; Sathe et al., 2009; Dokeroglu & Cosar, 2014). They also occur as main or sub problem in several optimization problems such as Cutting Stock problem (Gilmore & Gomory, 1961, 1963), Scheduling problems (Davidovié et al., 2012; Qiao et al., 2010), Loading and Resource Allocation problem (Zezzatti et al., 2012), Sheet Metal Forming Processes (Sathe et al., 2009) and problems of the Cloud Computing Management (Régin & Rezgui, 2011).