<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-7743</journal-id>
<journal-title><![CDATA[Ingeniería, investigación y tecnología]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. invest. y tecnol.]]></abbrev-journal-title>
<issn>1405-7743</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Facultad de Ingeniería]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-77432016000200179</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Un algoritmo para el Strip Packing Problem obtenido mediante la extracción de habilidades de expertos usando minería de datos]]></article-title>
<article-title xml:lang="en"><![CDATA[An Algorithm for the Strip Packing Problem Obtained by Extracting Expert Skills Using Data Mining]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gatica]]></surname>
<given-names><![CDATA[Gustavo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[Pablo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Contreras-Bolton]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Linfati]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Santiago de Chile Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Andrés Bello Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de Santiago de Chile Departamento de Ingeniería Informática ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad del Bío-Bío  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad del Valle Departamento de Contabilidad y Finanzas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2016</year>
</pub-date>
<volume>17</volume>
<numero>2</numero>
<fpage>179</fpage>
<lpage>190</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432016000200179&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-77432016000200179&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-77432016000200179&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: La capacidad del ser humano para resolver problemas NP-Duro de forma manual no ha recibido la debida atención por la comunidad científica. Este artículo considera el problema del Strip Packing, que consiste en posicionar ortogonalmente un conjunto de piezas rectangulares dentro de un contenedor de ancho fijo y altura infinita, sin solaparlas, minimizando la altura alcanzada de las piezas dentro del contenedor. Se desarrolló un juego computacional que permite obtener soluciones manuales, propuestas por jugadores expertos, para distintas instancias del problema. La contribución del artículo consiste en presentar un algoritmo que se extrajo mediante patrones y minería de datos aplicada a soluciones encontradas por los jugadores expertos. El algoritmo generado se basa en elementos de árboles y heurísticas presentes en la literatura. Adicionalmente se presentan resultados computacionales, donde se logra encontrar la mejor solución conocida en 94.3% de un conjunto de instancias de la literatura y 79% para instancias generadas aleatoriamente.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The ability of the humans to manually solve NP-hard problems had not received much attention of the scientific community. This paper considers the Strip Packing Problem (SPP), in which a set of rectangular pieces has to be placed orthogonally in a container with a given width and an infinite length. The pieces are not allowed to overlap (i.e. be stacked one over the other). The aim of the SPP is to minimize the overall length of the strip. In this paper, we have developed a computational game to allow manual solutions by expert gamers for different instances of the problem. The main contribution of the paper is the presentation of an algorithm based on patterns and data mining retrieved from the results achieved by expert gamers. The proposed algorithm is based on decision-trees and heuristics proposed in literature. Finally, the proposed approach is able to find the best-known solutions for the 94.3% of a set of instances proposed in the literature, and 79% for instances generated randomly.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Strip Packing Problem]]></kwd>
<kwd lng="es"><![CDATA[minería de algoritmos y patrones]]></kwd>
<kwd lng="es"><![CDATA[habilidades de expertos]]></kwd>
<kwd lng="en"><![CDATA[Strip Packing Problem]]></kwd>
<kwd lng="en"><![CDATA[data mining of algorithms and patterns]]></kwd>
<kwd lng="en"><![CDATA[skills of experts]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Acuña]]></surname>
<given-names><![CDATA[D.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Parada]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours]]></article-title>
<source><![CDATA[PLoS ONE]]></source>
<year>2010</year>
<volume>5</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>10</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alvarez-Valdés]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Parreño]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reactive GRASP for the strip-packing problem]]></article-title>
<source><![CDATA[Computer Operation Research]]></source>
<year>2008</year>
<volume>4</volume>
<numero>35</numero>
<issue>35</issue>
<page-range>1065-83</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Soubeiga]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu-search hyperheuristic for timetabling and rostering]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2003</year>
<volume>9</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>451-70</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Campitelli]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gobet]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Structure and stimulus familiarity: a study of memory in chess-players with functional magnetic resonance imaging]]></article-title>
<source><![CDATA[The Spanish Journal of Psychology]]></source>
<year>2005</year>
<volume>2</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>238-45</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Jong]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Schultz]]></surname>
<given-names><![CDATA[A.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Using experience-based learning in game playing]]></source>
<year></year>
<conf-name><![CDATA[ FifthInternational Conference on Machine Learning]]></conf-name>
<conf-date>1998</conf-date>
<conf-loc> </conf-loc>
<page-range>284-90</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Demaine]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Playing games with algorithms algorithmic combinatorial game theory]]></source>
<year>2001</year>
<conf-name><![CDATA[ 26Symposium on Mathematical Foundations in Computer Science]]></conf-name>
<conf-loc>Czech Republic </conf-loc>
<page-range>18-32</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Demaine]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Hohenberger]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Liben-Nowell]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Tetris is hard, even to approximate]]></source>
<year>2002</year>
<conf-name><![CDATA[ 9annual international conference on Computing and combinatorics]]></conf-name>
<conf-loc>Berlin </conf-loc>
<page-range>351-63</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Epstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the NP-completeness of cryptarithms]]></article-title>
<source><![CDATA[ACM SIGACT News]]></source>
<year>1987</year>
<volume>18</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>38-40</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraenkel]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Combinatorial game theory foundations applied to digraph kernels]]></article-title>
<source><![CDATA[Electronic Journal of Combinatoric]]></source>
<year>1997</year>
<volume>1</volume>
<page-range>13-42</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[D.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and intractability: a guide to the theory of NP-completeness]]></source>
<year>1979</year>
<publisher-loc><![CDATA[Nueva York ]]></publisher-loc>
<publisher-name><![CDATA[W.H. Freeman]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gatica]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Villagran]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Contreras-Bolton]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Linfati]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[J.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new genotype-phenotype genetic algorithm for the two-dimensional Strip Packing problem with rotation of 90° degrees]]></article-title>
<source><![CDATA[Ingeniería y Universidad]]></source>
<year>2016</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>177-96</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jaaksi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A method for your object-oriented project]]></article-title>
<source><![CDATA[Journal of Object-Oriented]]></source>
<year>1998</year>
<volume>10</volume>
<page-range>17-25</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klemettien]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[A knowledge discovery methodology for telecommunication network]]></source>
<year></year>
<conf-name><![CDATA[ twelfthinternational conference on data engineering]]></conf-name>
<conf-date>1999</conf-date>
<conf-loc>Finlandia </conf-loc>
<page-range>115-22</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lodi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Recent advances on two-dimensional bin packing problems]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2002</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>379-96</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nievergelt]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Exhaustive search, combinatorial optimization and enumeration: exploring the potential of raw computing power]]></source>
<year>2000</year>
<conf-name><![CDATA[ 27Conference on current trends in theory and practice of informatics (SOFSEM &#8249;00)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>18-35</page-range><publisher-loc><![CDATA[Londres ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pereira]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Domínguez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ocejo]]></surname>
<given-names><![CDATA[J. Sáez]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modelos de Previsão do Fracasso Empresarial: Aspectos a considerar]]></article-title>
<source><![CDATA[Revista de Estudos Politécnicos Polytechnical Studies Review]]></source>
<year>2007</year>
<volume>IV</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>111-48</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Russell]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Norvig]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial intelligence: A modern approach]]></source>
<year>1995</year>
<publisher-loc><![CDATA[Upper Saddle River, NJ, USA ]]></publisher-loc>
<publisher-name><![CDATA[Prentice-Hall, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stewart]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minesweeper as an NP-complete problem]]></article-title>
<source><![CDATA[ACM SIGCSE Bulletin]]></source>
<year>2005</year>
<numero>1</numero>
<issue>1</issue>
<page-range>39-40</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sunnucks]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Encyclopaedia of Chess]]></source>
<year>1970</year>
<publisher-loc><![CDATA[Nueva York ]]></publisher-loc>
<publisher-name><![CDATA[Robert Hale Ltd]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[P.Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two algorithms for constrained two-dimensional cutting stock problem]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>1983</year>
<volume>31</volume>
<page-range>109-15</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Witten]]></surname>
<given-names><![CDATA[I.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Frank]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data mining: practical machine learning tools and techniques]]></source>
<year>2000</year>
<publisher-loc><![CDATA[Nueva York ]]></publisher-loc>
<publisher-name><![CDATA[Morgan Kaufmann]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
