Computers and Operations Research

Problem Instance Data Set

Instances used in the article "An exact dynamic programming algorithm for the precedence-constrained class sequencing problem" by Bürgy, Hertz, Baptiste

Instances for the Pickup and Delivery Problem with Time Windows generated using open data on addresses and travel times. There are 300 instances in total, distributed in 12 sets according to the number of customer locations: 100, 200, 400, 600, 800, 1000, 1500, 2000, 2500, 3000, 4000, and 5000 locations. Each set contains 25 instances and is compressed in a single (.zip) file. Instructions to correctly read each instance file are available in a README inside the folder "Instances/". A table with detailed configurations of all instances can be found in the text file "configurations.txt". A valid solution for each instance is available inside the folder "Solutions/". The detailed structure of these files is described in the README file inside the same folder. The file README in the main folder contains general information about the datasets and related topics.

The random raster images and the five recognizable input images used in the experiments are presented.

This package contains Matlab code and data for manuscript

Heuristic solution costs and times for alternative methods

Instances and complete results

This is a simulated data set for a 6-hour on-demand meal delivery operation. There are 353 orders (approx. 1 order per minute), 50 delivery drones with different capacities and max. velocities and 4 charging depots. The simulated service area is a 500 by 500 square area.

Electronic appendix containing the instances and solution sets used for the study.

All 192 test instances used in the computational experiments of the article "Multi-level departments-to-offices assignment with different room types".