Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence

Table 3

Example of heuristics obtained for each instance set using Grammar 3.

Instance	Heuristic generated
dasaset1	Sort(Elements, Des) · Sort(Bin, Des) · ((𝐹+𝑆)) ≤ (abs(𝐶))
dataset2	Sort(Elements, Des) · Sort(Cont, Des) · (abs(𝑆)) ≤ (abs((𝐶−𝐹))))
dataset3	Sort(Elements, Des) · Sort(Cont, Des) · (𝑆) ≤ ((𝐶−𝐹))
binpack1	Sort(Content, Des) · (abs(𝐹)) ≤ ((𝐶 − abs(S)))
binpack2	Sort(Content, Des) · ((𝐹+𝑆)) ≤ (𝐶)
binpack3	Sort(Content, Des) · (𝐹) ≤ (abs((𝐶−𝑆)))
binpack4	Sort(Content, Asc) · (𝑆) ≤ ((𝐶−𝐹))
binpack5	((𝑆+𝐹)) ≤ (𝐶)
binpack6	(𝐹) ≤ ((abs(𝐶) − 𝑆))
binpack7	(abs(𝐹)) ≤ (abs((𝑆−𝐶)))
binpack8	(abs((𝑆+𝐹))) ≤ (𝐶)
hard28	Sort(Cont, Des) · (𝐹) ≤ (abs((𝐶−𝑆)))