<?xml version="1.0" encoding="UTF-8" standalone="yes"?><?xml-stylesheet type="text/xsl" href="/oai-pmh-repository/static/oai2.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-10-15T11:50:09Z</responseDate>
    <request verb="GetRecord" identifier="oai:data.mendeley.com/p4n2xw84bv.1" metadataPrefix="oai_dc">https://data.mendeley.com/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>oai:data.mendeley.com/p4n2xw84bv.1</identifier>
                <datestamp>2018-08-16T19:33:53Z</datestamp>
            </header>
            <metadata><oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" 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">
    <dc:creator>Rodriguez Martin, Inmaculada</dc:creator>
    <dc:title>PVRP-DC instances</dc:title>
    <dc:publisher>Mendeley Data</dc:publisher>
    <dc:description>Here are the 240 instances used in the article &quot;The Periodic Vehicle Routing Problem with Driver Consistency &quot;, written by Inmaculada Rodríguez-Martín, Juan-José Salazar-González, and Hande Yaman, and published in &quot;European Journal of Operational Research&quot; 2018. The instance name gives information about the number of nodes, the number of time periods, and the number of vehicles. For example, test11-p2-m3-a-dat is an instance wiht 11 nodes, 2 time periods, and 3 vehicles.

These data files have the same format as the classical PVRP instances from the literature, though the vehicles&apos; capacity and the customers&apos; demands are not considered in this paper. That is:

The first line contains the following information:
 
	type m n t

where

	type = 1 (PVRP),
	m = number of vehicles,
	n = number of customers,
	t = number of days.

The next t lines contain, for each day ,the following information:

        D Q

where

	D = maximum duration of a route (0 means &apos;unbounded&apos;), 
	Q = maximum load of a vehicle,

The next lines contain, for the depot and each customer, the following information:

	i x y d q f a list 

where

	i = customer number (0 corresponds to the depot),
	x = x coordinate,
	y = y coordinate,
	d = service duration,
	q = demand,
	f = frequency of visit,
	a = number of possible visit combinations,
	list = list of all possible visit combinations.

Each visit combination is coded with the decimal equivalent of the corresponding binary bit string. For example, in a 5-day period, the code 10 which is equivalent to the bit string 01010 means that a customer is visited on days 2 and 4. (Days are numbered from left to right.)
</dc:description>
    <dc:subject>Combinatorial Optimization</dc:subject>
    <dc:contributor>Salazar-González, Juan-José</dc:contributor>
    <dc:contributor>Yaman, Hande</dc:contributor>
    <dc:type>Dataset</dc:type>
    <dc:identifier>doi:10.17632/p4n2xw84bv.1</dc:identifier>
    <dc:identifier>oai:data.mendeley.com/p4n2xw84bv.1</dc:identifier>
    <dc:rights>Creative Commons Attribution 4.0 International</dc:rights>
    <dc:rights>http://creativecommons.org/licenses/by/4.0</dc:rights>
    <dc:relation>https://data.mendeley.com/datasets/p4n2xw84bv</dc:relation>
    <dc:date>2018-08-16T19:33:53Z</dc:date>
</oai_dc:dc></metadata>
        </record>
    </GetRecord>
</OAI-PMH>
