A Fuzzy approach for the variable cost and size bin packing

<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
  <record>
    <leader>00000cab a2200000   4500</leader>
    <controlfield tag="001">MAP20210024535</controlfield>
    <controlfield tag="003">MAP</controlfield>
    <controlfield tag="005">20210727140814.0</controlfield>
    <controlfield tag="008">210727e2021    esp|||p      |0|||b|spa d</controlfield>
    <datafield tag="040" ind1=" " ind2=" ">
      <subfield code="a">MAP</subfield>
      <subfield code="b">spa</subfield>
      <subfield code="d">MAP</subfield>
    </datafield>
    <datafield tag="084" ind1=" " ind2=" ">
      <subfield code="a">922.134</subfield>
    </datafield>
    <datafield tag="100" ind1=" " ind2=" ">
      <subfield code="0">MAPA20210030185</subfield>
      <subfield code="a">Herrera-Franklin, Jorge</subfield>
    </datafield>
    <datafield tag="245" ind1="1" ind2="3">
      <subfield code="a">A Fuzzy approach for the variable cost and size bin packing</subfield>
      <subfield code="c">Jorge Herrera-Franklin, Alejandro Rosete, Milton García-Borroto</subfield>
    </datafield>
    <datafield tag="520" ind1=" " ind2=" ">
      <subfield code="a">The Variable Cost and Size Bin Packing Problem (VCSBPP) is a known NP-Hard problem that consists in minimizingthe cost of all bins used to pack a set of items.  There are many real-life applications of the VCSBPP where the focus is to improve the efficiency of the solution method. In spite of the existence of fuzzy approaches to adapt other optimizationproblems to real life conditions, VCSBPP has not been  extensively studied in terms of relaxations of the crisp conditions. In this sense, the fuzzy approaches for the VCSBPP varies from relaxing the capacity of the bins to the items weights. In this paper we address a non-explored side consisting inrelaxing the set of items to be packed. Therefore, our main contribution is  a fuzzy version of VCSBPP that allows incomplete packing. The proposed fuzzy VCSBPP is solved by a parametric approach. Particularly, a fast heuristic algorithm is introduced that allows to obtain a set of solutions with interesting trade-offs between cost and relaxation of the original crisp conditions. An experimental study is presented to explore the proposed fuzzy VCSBPP and its solution.</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20080558055</subfield>
      <subfield code="a">Empaquetado</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20080546953</subfield>
      <subfield code="a">Embalaje</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20080553128</subfield>
      <subfield code="a">Algoritmos</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20210012600</subfield>
      <subfield code="a">Costes</subfield>
    </datafield>
    <datafield tag="700" ind1="1" ind2=" ">
      <subfield code="0">MAPA20210030192</subfield>
      <subfield code="a">Rosete, Alejandro</subfield>
    </datafield>
    <datafield tag="700" ind1="1" ind2=" ">
      <subfield code="0">MAPA20210030208</subfield>
      <subfield code="a">García-Borroto, Milton</subfield>
    </datafield>
    <datafield tag="773" ind1="0" ind2=" ">
      <subfield code="w">MAP20200034445</subfield>
      <subfield code="t">Revista Iberoamericana de Inteligencia Artificial</subfield>
      <subfield code="d">IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018-</subfield>
      <subfield code="x">1988-3064</subfield>
      <subfield code="g">15/02/2021 Volumen 24 Número 67 - febrero 2021 , p. 71-89</subfield>
    </datafield>
  </record>
</collection>