A Fuzzy approach for the variable cost and size bin packing

<?xml version="1.0" encoding="UTF-8"?><modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-8.xsd">
<mods version="3.8">
<titleInfo>
<nonSort xml:space="preserve">A F </nonSort>
<title>uzzy approach for the variable cost and size bin packing</title>
</titleInfo>
<name type="personal" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20210030192">
<namePart>Rosete, Alejandro</namePart>
<nameIdentifier>MAPA20210030192</nameIdentifier>
</name>
<name type="personal" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20210030208">
<namePart>García-Borroto, Milton</namePart>
<nameIdentifier>MAPA20210030208</nameIdentifier>
</name>
<typeOfResource>text</typeOfResource>
<genre authority="marcgt">periodical</genre>
<originInfo>
<place>
<placeTerm type="code" authority="marccountry">esp</placeTerm>
</place>
<dateIssued encoding="marc">2021</dateIssued>
<issuance>serial</issuance>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</language>
<physicalDescription>
<form authority="marcform">print</form>
</physicalDescription>
<abstract displayLabel="Summary">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.</abstract>
<note type="statement of responsibility">Jorge Herrera-Franklin, Alejandro Rosete, Milton García-Borroto</note>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080558055">
<topic>Empaquetado</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080546953">
<topic>Embalaje</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080553128">
<topic>Algoritmos</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20210012600">
<topic>Costes</topic>
</subject>
<classification authority="">922.134</classification>
<relatedItem type="host">
<titleInfo>
<title>Revista Iberoamericana de Inteligencia Artificial</title>
</titleInfo>
<originInfo>
<publisher>IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018-</publisher>
</originInfo>
<identifier type="issn">1988-3064</identifier>
<identifier type="local">MAP20200034445</identifier>
<part>
<text>15/02/2021 Volumen 24 Número 67 - febrero 2021 , p. 71-89</text>
</part>
</relatedItem>
<recordInfo>
<recordContentSource authority="marcorg">MAP</recordContentSource>
<recordCreationDate encoding="marc">210727</recordCreationDate>
<recordChangeDate encoding="iso8601">20210727140814.0</recordChangeDate>
<recordIdentifier source="MAP">MAP20210024535</recordIdentifier>
<languageOfCataloging>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</languageOfCataloging>
</recordInfo>
</mods>
</modsCollection>