SciELO - Scientific Electronic Library Online

 
vol.20 número1Design of an Optimal Multilayer Electromagnetic Absorber through Spiral AlgorithmAcceptability of Implementing High Occupancy Vehicle Lanes on the North Highway in Bogota índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


Ingeniería y Universidad

versão impressa ISSN 0123-2126

Resumo

VILLAGRAN, Gonzalo; CONTRERAS-BOLTON, Carlos; LINFATI, Rodrigo  e  ESCOBAR, John Willmer. A New Genotype-Phenotype Genetic Vlgorithm for the Two-Dimensional Strip Packing Problem with Rotation of 90°1. Ing. Univ. [online]. 2016, vol.20, n.1, pp.119-138. ISSN 0123-2126.  https://doi.org/10.11144/Javeriana.iyu20-1.ngpg.

Given a set of rectangular pieces and a fixed width with infinite length, the strip-packing problem (SPP) of two dimensions (2D), with a rotation of pieces in 90° consists of orthogonally placing all the pieces on the strip, without overlapping them, minimizing the height of the strip used. Several algorithms have been proposed to solve this problem, being Genetic Algorithms one of the most popular approach due to it effectiveness solving NP-Hard problems. In this paper, three binary representations, and classic crossover and mutation operators are introduced. A comparison of the three binary representations on a subset of benchmarking instances is performed. The representation R2 outperforms the results obtained by representation R1 and R3. Indeed, some of the best-known results found by previous published approaches are improved.

Palavras-chave : strip packing problem; genotype-phenotype; genetic algorithm; phenotype generation; problema de strip packing; genotipo-fenotipo; algoritmo genético; generación fenotipo.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons