European Journal of Operational Research

Here are the 240 instances used in the article "The Periodic Vehicle Routing Problem with Driver Consistency ", written by Inmaculada Rodríguez-Martín, Juan-José Salazar-González, and Hande Yaman, and published in "European Journal of Operational Research" 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' capacity and the customers' 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 'unbounded'), 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.)

Here are the 240 instances for the "Capacitated Vehicle Routing Problem" used in the article "The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time", written by Adam Letchord and Juan-Jose Salazar-Gonzalez, and published in "European Journal of Operational Research" 2018. https://doi.org/10.1016/j.ejor.2018.06.002 Each instance has 15 customers and 1 depot, and is in a text file following the TSPLIB95 format for CVRP instances. There are instances with asymmetric (A) and with symmetric (S) distances, with unit demands (U) and with general demands (G). The U instances have vehicle capacity in {4,6,8} and the G instances have vehicle capacity in {100,150,200}.

These benchmark instances can be used for evaluating strategies for pickup and delivery problems with time window uncertainties. There are 2800 data files, each describing a separate problem instance. The detailed description of the content of the files can be found in the readme.txt file.

There are: 1) 3L-SDVRP-instance-sets, which including Shanghai instance set and B-Y instance set; 2) Results of the above instances.

Data for an Anonymous Call Center Operation

These files allow one to reproduce Figure 1 in the paper.

This is the sourcecode of my contribution to the MISTA 2013 Challenge.

Input and output data.

Data for job scheduling in a server. The data is divided into 5 ZIP files. Each zip file contains a collection of text files, where each file contains the information of all jobs arriving on a day to the server. The text file structure is as follows: <instance ID> p <list of CPU cycles required> w <list of priority weights> r <list of release dates> pr <list of precedence constraints in pars of the form [parent, child]> The information in p, w, and r, follow the format of dictionaries in Python (job ID: information), whereas pr has the format of a Python list. The "results.xls" file, has 10 Excel sheets, with the best lower bound, and upper bound (i.e. schedule value) known for that instance. There are two sheets for each set of instances, one with the results considering release dates (ends in "wr") and one with the results without considering release dates (ends in "nr"). In all cases, the schedule was evaluated as total completion time, plus total energy consumption as described in "Resource Cost Aware Scheduling" by Carrasco, Iyengar, and Stein (https://doi.org/10.1016/j.ejor.2018.02.059).

Programs and instance files used on the paper "Heuristics for Packing Semifluids"