Evolving Bin Packing Heuristic Using Micro-Differential Evolution With Indirect Representation

The development of low-level heuristics for solving instances of a problem is relatedto the knowledge of an expert. He needs to analyze several components from the problema(sic)(TM) s instance and to think out an specialized heuristic for solving the instance. However if any inherent component to the instance gets changes, then the designed heuristic may not work as it used to do it. In this paper it is presented a novel approach to generated low-level heuristics; the proposed approach implements micro-Differential Evolution for evolving an indirect representation of the Bin Packing Problem. It was used the Hard28 instance, which is a well-known and referenced Bin Packing Problem instance. The heuristics obtained by the proposed approach were compared against the well-know First-Fit heuristic, the results of packing that were gotten for each heuristic were analized by the statistic non-parametric test known as Wilcoxon Signed-Rank test.