<?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>1815-5944</journal-id>
<journal-title><![CDATA[Ingeniería Mecánica]]></journal-title>
<abbrev-journal-title><![CDATA[Ingeniería Mecánica]]></abbrev-journal-title>
<issn>1815-5944</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería Mecánica. Instituto Superior Politécnico "José Antonio Echeverría"]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1815-59442020000200008</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Influencia de distribuciones estadísticas en la complejidad de instancias del problema de empaquetamiento con tamaño y costo variable]]></article-title>
<article-title xml:lang="en"><![CDATA[Influence of statistical distributions in the hardness of instances of the variable size and cost bin packing problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Herrera-Franklin]]></surname>
<given-names><![CDATA[Jorge]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete-Suárez]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[Milton]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cabrera-García]]></surname>
<given-names><![CDATA[Suitberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Centro de Investigación y Manejo Ambiental del Transporte, CIMAB  ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría Facultad de Ingeniería Informática ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Politécnica de Valencia Dpto. de Estadística, Investigación Operativa Aplicadas y Calidad ]]></institution>
<addr-line><![CDATA[ Valencia]]></addr-line>
<country>España</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2020</year>
</pub-date>
<volume>23</volume>
<numero>2</numero>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S1815-59442020000200008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S1815-59442020000200008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S1815-59442020000200008&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Problema de Empaquetamiento con Tamaño y Costo Variable consiste en minimizar el costo de todos los contenedores utilizados para empacar un conjunto de elementos. En los trabajos previos encontrados se han presentado y estudiado varios algoritmos para resolver diferentes instancias de este problema donde los pesos de los elementos a empaquetar siguen Distribución Uniforme. El objetivo del presente trabajo fue estudiar la influencia de la distribución estadística que siguen los componentes de las instancias del problema en su complejidad. Para ello, se diseñaron tres conjuntos de instancias de referencia que siguen diferentes distribuciones estadísticas y se utilizó el solver SCIP para resolver las mismas. De estos experimentos se obtuvo que las instancias donde los pesos de los elementos siguen Distribución Normal y las capacidades de los contenedores siguen la Distribución Weibull son más difíciles de resolver que las instancias con características similares a las estudiadas en los artículos previos.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The Variable Size and Cost Bin Packing Problem consists of minimizing the cost of all the containers used to pack a set of items. In the previous works, several algorithms have been presented and studied, to solve different instances of this problem where the weights of the elements to be packed follow Uniform Distribution. The objective of this work is to study the influence of the statistical distribution that the components of the instances of the problem follow in their complexity. For this, three sets of reference instances were designed that follow different statistical distributions and the SCIP solver was used to solve them. From these experiments, it was obtained that the instances where the weights of the elements follow the Normal Distribution and the capacities of the containers follow the Weibull Distribution are more difficult to solve than the instances with characteristics similar to those studied in the previous articles.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[optimización combinatoria]]></kwd>
<kwd lng="es"><![CDATA[problema de empaquetamiento con tamaño y costo variable]]></kwd>
<kwd lng="es"><![CDATA[instancias de referencia]]></kwd>
<kwd lng="es"><![CDATA[análisis estadístico]]></kwd>
<kwd lng="en"><![CDATA[combinatorial optimization]]></kwd>
<kwd lng="en"><![CDATA[variable size and cost bin packing problem]]></kwd>
<kwd lng="en"><![CDATA[benchmark instances]]></kwd>
<kwd lng="en"><![CDATA[statistical analysis]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Christensen]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Khan]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Pokutta]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximation and online algorithms for multidimensional bin packing: A survey]]></article-title>
<source><![CDATA[Computer Science Review]]></source>
<year>2017</year>
<volume>24</volume>
<page-range>63-79</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balogh]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Békési]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Dósa]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Online bin packing with cardinality constraints resolved]]></article-title>
<source><![CDATA[Journal of Computer and System Sciences]]></source>
<year>2020</year>
<volume>112</volume>
<page-range>34-49</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Crainic]]></surname>
<given-names><![CDATA[TG]]></given-names>
</name>
<name>
<surname><![CDATA[Perboli]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Rei]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient lower bounds and heuristics for the variable cost and size bin packing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2011</year>
<volume>38</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1474-82</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hemmelmayr]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Schmida]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Blum]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable neighbourhood search for the variable sized bin packing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1097-108</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraire Huacuja]]></surname>
<given-names><![CDATA[HJ]]></given-names>
</name>
<name>
<surname><![CDATA[Padilla]]></surname>
<given-names><![CDATA[AE]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Reyes]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable Neighborhood Search Algorithm for the Variable Cost and Size Bin Packing Problem]]></article-title>
<source><![CDATA[Handbook of Research on Metaheuristics for Order Picking Optimization in Warehouses to Smart Cities]]></source>
<year>2019</year>
<publisher-loc><![CDATA[Hershey PA ]]></publisher-loc>
<publisher-name><![CDATA[IGI Global]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haouari]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Serairi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristics for the variable sized bin-packing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2009</year>
<volume>36</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2877-84</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Correia]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
<name>
<surname><![CDATA[Gouveia]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Da Gama]]></surname>
<given-names><![CDATA[FS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving the variable size bin packing problem with discretized formulations]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2008</year>
<volume>35</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>2103-13</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Castelli]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Vanneschi]]></surname>
<given-names><![CDATA[LA]]></given-names>
</name>
</person-group>
<source><![CDATA[hybrid harmony search algorithm with variable neighbourhood search for the bin-packing problem]]></source>
<year>2014</year>
<conf-name><![CDATA[ 6th World Congress on Nature and Biologically Inspired Computing (NaBIC)]]></conf-name>
<conf-loc>Porto, Portugal </conf-loc>
<publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brandão]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Pedroso]]></surname>
<given-names><![CDATA[JP]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bin packing and related problems: General arc-flow formulation with graph compression]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2016</year>
<volume>69</volume>
<page-range>56-67</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sridhar]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Chandrasekaran]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Sriramya]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization of heterogeneous Bin packing using adaptive genetic algorithm]]></source>
<year>2017</year>
<conf-name><![CDATA[ IOP Conference Series: Materials Science and Engineering]]></conf-name>
<conf-loc> </conf-loc>
<publisher-name><![CDATA[IOP Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraire Huacuja]]></surname>
<given-names><![CDATA[HJ]]></given-names>
</name>
<name>
<surname><![CDATA[Estrada Padilla]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz Reyes]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable neighborhood search algorithm for the variable cost and size bin packing problem]]></article-title>
<source><![CDATA[Handbook of Research on Metaheuristics for Order Picking Optimization in Warehouses to Smart Cities]]></source>
<year>2019</year>
<publisher-name><![CDATA[IGI Global]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bang-Jensen]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Larsen]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient algorithms for real-life instances of the variable size bin packing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>2848-57</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beasley]]></surname>
<given-names><![CDATA[JE]]></given-names>
</name>
</person-group>
<source><![CDATA[OR-Library]]></source>
<year>2009</year>
<publisher-loc><![CDATA[London, UK ]]></publisher-loc>
<publisher-name><![CDATA[Brunel Unversity]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casazza]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Ceselli]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Column generation for the variable cost and size bin packing problem with fragmentation]]></article-title>
<source><![CDATA[Electronic Notes in Discrete Mathematics]]></source>
<year>2016</year>
<volume>55</volume>
<page-range>61-4</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casazza]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation]]></article-title>
<source><![CDATA[Optimization Letters]]></source>
<year>2019</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>379-98</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Herrera Franklin]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[García Borroto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the impact of fuzzy constraints in the variable size and cost bin packing problem]]></article-title>
<source><![CDATA[Information Processing and Management of Uncertainty in Knowledge-Based Systems Springer International Publishing Cham]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schwarz]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[An introduction to SCIP]]></source>
<year>2018</year>
<conf-name><![CDATA[ SCIP Workshop 2018]]></conf-name>
<conf-loc>Germany </conf-loc>
<publisher-name><![CDATA[Zuse Institute Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koch]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Zimpl user guide (zuse institute mathematical programming language). Berlin,]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Germany ]]></publisher-loc>
<publisher-name><![CDATA[Technische Universität Berlin]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Chugh]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Data-Driven Eutionary Optimization: An Overview and Case Studies]]></article-title>
<source><![CDATA[IEEE Transactions on Eutionary Computation]]></source>
<year>2019</year>
<volume>23</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>442-58</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
