Greedy Seeding Procedure for GAs Solving a Strip Packing Problem

In this paper, the two-dimensional strip packing problem with 3-stage level patterns is tackled using genetic algorithms (GAs). We evaluate the usefulness of a knowledge-based greedy seeding procedure used for creating the initial population. This is motivated by the expectation that the seeding will speed up the GA by starting the search in promising regions of the search space. An analysis of the impact of the seeded initial population is offered, together with a complete study of the influence of these modifications on the genetic search. The results show that the use of an appropriate seeding of the initial population outperforms existing GA approaches on all the used problem instances, for all the metrics used, and in fact it represents the new state of the art for this problem.Fil: Salto, Carolina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Pampa. Facultad de Ingeniería. Departamento de Informática; ArgentinaFil: Alba, Enrique. Universidad de Malaga. Escuela Técnica Superior de Ingeniería Informática.; EspañaFil: Molina, Juan M.. Universidad de Malaga. Escuela Técnica Superior de Ingeniería Informática.; EspañaFil: Leguizamon, Guillermo Nolasco. Universidad Nacional de San Luis; Argentin