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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2007
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23576 |
| Aporte de: |
| Sumario: | 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. |
|---|