<?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-04-13T02:57:43Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/8719" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/8719</identifier><datestamp>2025-07-17T01:23:13Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>An exact algorithm for the single-vehicle cyclic inventory routing problem</dc:title>
   <dc:creator>Aghezzaf, El-Houssaine</dc:creator>
   <dc:creator>Zhong, Yiqing</dc:creator>
   <dc:creator>Raa, Birger</dc:creator>
   <dc:creator>Mateo Doll, Manuel</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Economia i organització d'empreses</dc:subject>
   <dc:subject>Logística (Indústria)</dc:subject>
   <dc:description>The single-vehicle cyclic inventory routing problem (SV 􀀀 CIRP) consists of a repetitive&#xd;
distribution of a product from a single depot to a selected subset of customers. For each customer that is&#xd;
selected for replenishments, the supplier collects a corresponding  xed reward. The objective is to determine&#xd;
the subset of customers to replenish, the quantity of the product to be delivered to each, and to design the&#xd;
vehicle route so that the resulting pro t (di erence between the total reward and the total logistical cost) is&#xd;
maximized while preventing stockouts at each of the selected customers. In this paper, the SV 􀀀 CIRP is&#xd;
formulated as a mixed-integer program with a nonlinear objective function. After an e cient analysis of&#xd;
the problem, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of&#xd;
linear mixed-integer programs. Values of an insertion-based heuristic for this problem are compared to the&#xd;
optimal values obtained for a set of some test problems. In general the gap may get as large as 25%, which&#xd;
justi es the e ort to continue exploring and developing exact and approximation algorithms for the SV 􀀀CIRP.</dc:description>
   <dc:description>Postprint (published version)</dc:description>
   <dc:date>2010</dc:date>
   <dc:type>Conference lecture</dc:type>
   <dc:identifier>Aghezzaf, E. [et al.]. An exact algorithm for the single-vehicle cyclic inventory routing problem. A: International Conference of Modeling and Simulation. "8th International Conference of Modeling and Simulation". Hammamet: 2010, p. 1-9.</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/8719</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Spain</dc:rights>
   <dc:format>9 p.</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>