<?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-31T00:03:15Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/6911" metadataPrefix="etdms">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><thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>An agile and reactive biased-randomized heuristic for an agri-food rich vehicle routing problem</title>
<creator>Tordecilla, Rafael D.</creator>
<creator>Copado-Méndez, Pedro J.</creator>
<creator>Panadero, Javier</creator>
<creator>Martins, Leandro do C.</creator>
<creator>Juan, Angel A.</creator>
<subject>Logística</subject>
<subject>Operaciones</subject>
<subject>Logistics</subject>
<subject>Operations</subject>
<description>Trabajo presentado en: R-Evolucionando el transporte, XIV Congreso de Ingeniería del Transporte (CIT 2021), realizado en modalidad online los días 6, 7 y 8 de julio de 2021, organizado por la Universidad de Burgos</description>
<description>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.</description>
<date>2022-09-19</date>
<date>2022-09-19</date>
<date>2021-07</date>
<type>info:eu-repo/semantics/conferenceObject</type>
<identifier>978-84-18465-12-3</identifier>
<identifier>http://hdl.handle.net/10259/6911</identifier>
<identifier>10.36443/10259/6911</identifier>
<language>eng</language>
<relation>R-Evolucionando el transporte</relation>
<relation>http://hdl.handle.net/10259/6490</relation>
<relation>https://doi.org/10.36443/9788418465123</relation>
<relation>info:eu-repo/grantAgreement/EC/H2020/282300206-UC005/EU/Internet of Food and Farm 2020</relation>
<relation>info:eu-repo/grantAgreement/UdLS//INGPhD-12-2020</relation>
<rights>info:eu-repo/semantics/openAccess</rights>
<publisher>Universidad de Burgos. Servicio de Publicaciones e Imagen Institucional</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>