Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem

A grouping genetic algorithm with controlled gene transmission for the bin packing problem

“…This heuristic outperforms the best algorithms from the state-of-the-art HI_BP, C_BP and WA [8,17,20]. In their paper, Fleszar and Charalambous [6] presented corrections to the results that were reported by Loh et.al [20] for the WA heuristic.…”

“…The study of the literature that is related to the BPP solution revealed that, until now, the best algorithms are the following: HGGA [7], HI_BP [8] and Perturbation-SAWMBS [6]. In Section 6, we compared the results that were obtained by our algorithm with the results that were obtained by these approaches; this comparison showed the impact of our strategies, which promote the best characteristics of the BPP solutions.…”

“…The most recent work in this area, to our knowledge, was presented by Fleszar and Charalambous [6]. The authors proposed a modification to the Perturbation-MBS' method [13] that uses a new sufficient average weight (SAW) principle to control the average weight of the items that are packed in each bin (Perturbation-SAWMBS).…”

“…The performance of the algorithms has been evaluated with different types of published problems that were considered to be very hard. The most relevant results have been obtained by means of hybrid and heuristic algorithms [6][7][8].…”

“…The proposed algorithm and its main components are experimentally contrasted with related studies from the literature to confirm that the gene transmission strategy is a promising approach. Experimental results show that GGA-CGT obtains high-quality solutions in a short amount of time for all of the standard instances, outperforming the effectiveness of the best algorithms that are state-of-the-art in the most difficult instances, the Hard28 class [5,6].…”