<?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-77432016000200155</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Una nueva estrategia heurística para el problema de Bin Packing]]></article-title>
<article-title xml:lang="en"><![CDATA[A New Heuristic Strategy for the Bin Packing Problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez-Ortega]]></surname>
<given-names><![CDATA[Joaquín]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Castillo-Zacatelco]]></surname>
<given-names><![CDATA[Hilda]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vilariño-Ayala]]></surname>
<given-names><![CDATA[Darnes]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mexicano-Santoyo]]></surname>
<given-names><![CDATA[Adriana]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zavala-Díaz]]></surname>
<given-names><![CDATA[José Crispín]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez-Rebollar]]></surname>
<given-names><![CDATA[Alicia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Estrada-Esquivel]]></surname>
<given-names><![CDATA[Hugo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Centro Nacional de Investigación y Desarrollo Tecnológico Departamento de Ciencias Computacionales ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Facultad de Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Instituto Tecnológico de Cd. Victoria  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Autónoma del Estado de Morelos Facultad de Contaduría, Administración e Informática ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af6">
<institution><![CDATA[,Centro Nacional de Investigación y Desarrollo Tecnológico Departamento de Ciencias Computacionales ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af7">
<institution><![CDATA[,Fondo de Información y Documentación para la Industria  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</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>155</fpage>
<lpage>168</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432016000200155&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-77432016000200155&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-77432016000200155&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: El problema de Bin Packing (BPP) es NP-duro, por lo que un método exacto para resolver instancias del BPP requiere un gran número de variables y demasiado tiempo de ejecución. En este trabajo se propone una nueva estrategia heurística para resolver instancias del BPP en donde se garantiza la solución óptima. La estrategia propuesta incluye el uso de un nuevo modelo exacto basado en arcos de flujo. En el modelo propuesto, el número de variables se redujo asignando objetos en contenedores. Adicionalmente se incluye una heurística que mediante el preprocesado de la instancia permite reducir su tamaño y con ello el espacio de búsqueda del algoritmo de solución. Para validar el enfoque propuesto, se realizaron experimentos usando los conjuntos de prueba hard28, 53nirup, bin1data, uniform, triplets y subconjuntos de otras instancias, todos ellos conocidos en el estado del arte. Los resultados muestran que empleando nuestro enfoque es posible encontrar la solución óptima de todas las instancias de prueba. Además, el tiempo de ejecución se redujo en relación con lo reportado por el modelo basado en arcos de flujo. Las reducciones de tiempo fueron de 19.7 y 43% para los conjuntos 53nirup y hard28, respectivamente.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The Bin Packing problem (BPP) is NP-hard, the use of exact methods for solving BPP instances require a high number of variables and therefore a high computational cost. In this paper a new heuristic strategy for solving the BPP instances, which guarantees obtain optimal solutions, is proposed. The proposed strategy includes the use of a new model based on flow arcs. In the proposed model, the number of variables was reduced by previous allocation of objects in bins. Additionally, our approach includes a heuristic that allows reducing the instance size and thereby the solution algorithm search space. To validate the proposed approach, experiments were performed using the test sets hard28, 53nirup, bin1data and falkenauer, all of them well known in the state of the art. The results show that it using our approach is possible to find the optimal solution for all test set. Also, the execution time was reduced in regard the reported time obtained by using the flow arc model. Time reductions were up to 19.7 and 43% for 53nirup and hard28 test set, respectively.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[heurística]]></kwd>
<kwd lng="es"><![CDATA[Bin Packing]]></kwd>
<kwd lng="es"><![CDATA[arcos de flujo]]></kwd>
<kwd lng="es"><![CDATA[modelo exacto para BPP]]></kwd>
<kwd lng="es"><![CDATA[límite inferior]]></kwd>
<kwd lng="es"><![CDATA[instancias del BPP]]></kwd>
<kwd lng="en"><![CDATA[heuristic]]></kwd>
<kwd lng="en"><![CDATA[bin packing]]></kwd>
<kwd lng="en"><![CDATA[flow arcs]]></kwd>
<kwd lng="en"><![CDATA[exact model for BPP]]></kwd>
<kwd lng="en"><![CDATA[lower bound]]></kwd>
<kwd lng="en"><![CDATA[instances of the BPP]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Álvarez]]></surname>
<given-names><![CDATA[V.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modelo para representar la complejidad del problema y el desempeño de algoritmos]]></source>
<year>2006</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Instituto Tecnológico de Ciudad Madero]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alves]]></surname>
<given-names><![CDATA[F.D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bin packing and related problems:pattern-based approaches]]></source>
<year>2012</year>
<publisher-loc><![CDATA[Portugal ]]></publisher-loc>
<publisher-name><![CDATA[Faculdade de Ciencias, Universidade do Porto]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alvim]]></surname>
<given-names><![CDATA[A.C.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Ribeiro]]></surname>
<given-names><![CDATA[C.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Aloise]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid improvement heuristic for the Bin Packing problem]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2004</year>
<volume>10</volume>
<page-range>205-29</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Disjuntive programming]]></article-title>
<source><![CDATA[Annals of Discrete Mathematics]]></source>
<year>1979</year>
<volume>5</volume>
<page-range>3-51</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hyde]]></surname>
<given-names><![CDATA[M.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Providing a memory mechanism to enhance the evolutionary design of heuristics]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the IEEE World Congress on Computational Intelligence (CEC 2010)]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cambazard]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[O&#8217;Sullivan]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Propagating the bin packing constraint using linear programming, CP&#8217;10]]></source>
<year></year>
<conf-name><![CDATA[ 16international conference on Principles and practice of constraint programming]]></conf-name>
<conf-loc> </conf-loc>
<page-range>129-36</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Clasificación de algoritmos heurísticos para la solución de problemas de Bin Packing]]></source>
<year>2004</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Falkenauer]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid grouping genetic algorithm for Bin Packing]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>1996</year>
<volume>2</volume>
<page-range>5-30</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garey]]></surname>
<given-names><![CDATA[M.R.]]></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 and Company]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jarboui]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibrahim]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Rebai]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new destructive bounding scheme for the bin packing problem]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>2010</year>
<volume>179</volume>
<page-range>187-202</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<source><![CDATA[LINGO user&#8217;s guide]]></source>
<year>2008</year>
<publisher-loc><![CDATA[USA ]]></publisher-loc>
<publisher-name><![CDATA[Lindo Systems INC.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Knapsack problems. Algorithms and computer. Implementations]]></source>
<year>1990</year>
<publisher-loc><![CDATA[Inglaterra ]]></publisher-loc>
<publisher-name><![CDATA[DEIS University of Bologna]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mexicano]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Caracterización de conjuntos de instancias difíciles del problema de Bin Packing orientada a la mejora de algoritmos metaheurísticos mediante el uso de técnicas de minería de datos]]></source>
<year>2004</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Centro Nacional de Investigación y Desarrollo Tecnológico (CENIDET)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Castillo]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Vilariño]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[De-la-Rosa]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mexicano]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Zavala]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Santaolaya]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Estrada]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristic for selecting lower bound applied to the problema of bin packing]]></source>
<year>2014</year>
<conf-name><![CDATA[ Conference Proceedings International Conference on Innovative Trends in Science, Engineering and Management 2014 (ICITSEM2014)]]></conf-name>
<conf-loc>Dubai, UAE </conf-loc>
<page-range>196-201</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schaus]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving balancing and Bin Packing problems with constraint programming]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Belgica ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shaw]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A constraint for bin packing]]></source>
<year>2004</year>
<page-range>648-62</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schoenfields]]></surname>
<given-names><![CDATA[J.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fast, exact solution of open packing problems without linear programming]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Huntsville, Alabama, USA ]]></publisher-loc>
<publisher-name><![CDATA[US Army Space &amp; Missile Defense Command]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scholl]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Klein]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Jürgens]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem]]></article-title>
<source><![CDATA[Computers Operations Research]]></source>
<year>1997</year>
<volume>24</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>627-45</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schwerin]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Wäscher]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new lower bound for the Bin Packing problem and its integration into MTP]]></article-title>
<source><![CDATA[Pesquisa Operacional]]></source>
<year>1999</year>
<volume>19</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>111-30</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Taha]]></surname>
<given-names><![CDATA[H.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Investigación de operaciones y flujo en redes]]></source>
<year>2004</year>
<edition>5</edition>
<publisher-name><![CDATA[Alfaomega]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valerio-De Carvalho]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exact solution of bin packing problems using column generation and branch and bound]]></article-title>
<source><![CDATA[Annals of Operation Research]]></source>
<year>1999</year>
<volume>86</volume>
<page-range>629-59</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valerio-De Carvalho]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[LP models for bin packing and cutting stock problems]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2002</year>
<volume>141</volume>
<page-range>253-73</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
