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 greedy seeding procedure for creating the initial population, incorporating problem knowledge. This is motivated by the expectation that the...

Descripción completa

Detalles Bibliográficos
Autores principales: Salto, Carolina, Alba Torres, Enrique, Molina, J.M., Leguizamón, Guillermo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2007
Materias:
Ciencias Informáticas
Informática
Biology and genetics
Algorithms
genetic algorithms
strip packing
seeding
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23576
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23576
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Informática
Biology and genetics
Algorithms
genetic algorithms
strip packing
seeding
spellingShingle Ciencias Informáticas
Informática
Biology and genetics
Algorithms
genetic algorithms
strip packing
seeding
Salto, Carolina
Alba Torres, Enrique
Molina, J.M.
Leguizamón, Guillermo
Greedy seeding procedure for GAs solving a strip packing problem
topic_facet Ciencias Informáticas
Informática
Biology and genetics
Algorithms
genetic algorithms
strip packing
seeding
description 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 greedy seeding procedure for creating the initial population, incorporating problem knowledge. 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.
format Objeto de conferencia
Objeto de conferencia
author Salto, Carolina
Alba Torres, Enrique
Molina, J.M.
Leguizamón, Guillermo
author_facet Salto, Carolina
Alba Torres, Enrique
Molina, J.M.
Leguizamón, Guillermo
author_sort Salto, Carolina
title Greedy seeding procedure for GAs solving a strip packing problem
title_short Greedy seeding procedure for GAs solving a strip packing problem
title_full Greedy seeding procedure for GAs solving a strip packing problem
title_fullStr Greedy seeding procedure for GAs solving a strip packing problem
title_full_unstemmed Greedy seeding procedure for GAs solving a strip packing problem
title_sort greedy seeding procedure for gas solving a strip packing problem
publishDate 2007
url http://sedici.unlp.edu.ar/handle/10915/23576
work_keys_str_mv AT saltocarolina greedyseedingprocedureforgassolvingastrippackingproblem
AT albatorresenrique greedyseedingprocedureforgassolvingastrippackingproblem
AT molinajm greedyseedingprocedureforgassolvingastrippackingproblem
AT leguizamonguillermo greedyseedingprocedureforgassolvingastrippackingproblem
bdutipo_str Repositorios
_version_ 1764820465922080768

Ejemplares similares