Artículo
Greedy Seeding Procedure for GAs Solving a Strip Packing Problem
Fecha de publicación:
12/2008
Editorial:
Sociedad Iberoamericana de Inteligencia Artificial
Revista:
Inteligencia Artificial
ISSN:
1137-3601
e-ISSN:
1988-3064
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Palabras clave:
GENETIC ALGORITHMS
,
STRIP PACKING
,
SEEDING
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(CCT - SAN LUIS)
Articulos de CTRO.CIENTIFICO TECNOL.CONICET - SAN LUIS
Articulos de CTRO.CIENTIFICO TECNOL.CONICET - SAN LUIS
Citación
Salto, Carolina; Alba, Enrique; Molina, Juan M.; Leguizamon, Guillermo Nolasco; Greedy Seeding Procedure for GAs Solving a Strip Packing Problem; Sociedad Iberoamericana de Inteligencia Artificial; Inteligencia Artificial; 12; 40; 12-2008; 73-85
Compartir
Altmétricas