<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-07-30T20:43:45Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/6911" metadataPrefix="qdc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/6911</identifier><datestamp>2024-05-17T09:30:47Z</datestamp><setSpec>com_10259.4_104</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_6848</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>An agile and reactive biased-randomized heuristic for an agri-food rich vehicle routing problem</dc:title>
<dc:creator>Tordecilla, Rafael D.</dc:creator>
<dc:creator>Copado-Méndez, Pedro J.</dc:creator>
<dc:creator>Panadero, Javier</dc:creator>
<dc:creator>Martins, Leandro do C.</dc:creator>
<dc:creator>Juan, Angel A.</dc:creator>
<dc:subject>Logística</dc:subject>
<dc:subject>Operaciones</dc:subject>
<dc:subject>Logistics</dc:subject>
<dc:subject>Operations</dc:subject>
<dcterms:abstract>Operational problems in agri-food supply chains usually show characteristics that are&#xd;
scarcely addressed by traditional academic approaches. These characteristics make an&#xd;
already NP-hard problem even more challenging; hence, this problem requires the use of&#xd;
tailor-made algorithms in order to solve it efficiently. This work addresses a rich vehicle&#xd;
routing problem in a real-world agri-food supply chain. Different types of animal food&#xd;
products are distributed to raising-pig farms. These products are incompatible, i.e., multicompartment&#xd;
heterogeneous vehicles must be employed to perform the distribution&#xd;
activities. The problem considers constraints regarding visit priorities among farms, and&#xd;
not-allowed access of large vehicles to a subset of farms. Finally, a set of flat tariffs are&#xd;
employed to formulate the cost function. This problem is solved employing a reactive&#xd;
savings-based biased-randomized heuristic, which does not require any time-costly&#xd;
parameter fine-tuning process. Our results show savings in both cost and traveled distance&#xd;
when compared with the real supply chain performance.</dcterms:abstract>
<dcterms:dateAccepted>2022-09-19T09:42:56Z</dcterms:dateAccepted>
<dcterms:available>2022-09-19T09:42:56Z</dcterms:available>
<dcterms:created>2022-09-19T09:42:56Z</dcterms:created>
<dcterms:issued>2021-07</dcterms:issued>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:identifier>978-84-18465-12-3</dc:identifier>
<dc:identifier>http://hdl.handle.net/10259/6911</dc:identifier>
<dc:identifier>10.36443/10259/6911</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>R-Evolucionando el transporte</dc:relation>
<dc:relation>http://hdl.handle.net/10259/6490</dc:relation>
<dc:relation>https://doi.org/10.36443/9788418465123</dc:relation>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/282300206-UC005/EU/Internet of Food and Farm 2020</dc:relation>
<dc:relation>info:eu-repo/grantAgreement/UdLS//INGPhD-12-2020</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Universidad de Burgos. Servicio de Publicaciones e Imagen Institucional</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>