Instances for the Pickup and Delivery Problem with Time Windows based on open data
Description
Instances generated using open data on addresses and travel times for the Pickup and Delivery Problem with Time Windows. The generation procedure, as well as initial upper bounds, were introduced in the master's thesis "The Pickup and Delivery Problem with Time Windows: Algorithms, Instances, and Solutions". There are 300 instances in total, with 25 for each size (number of customer locations): 100, 200, 400, 600, 800, 1000, 1500, 2000, 2500, 3000, 4000, and 5000 locations. Instances were generated with a variety of characteristics including city, distribution, depot location, time window width, and time horizon. More information can be found in the research paper as well as in the associated repository (https://github.com/cssartori/pdptw-instances), which also contains a solution validator and detailed best-known solutions for each instance separately. The file README describes the organization of instance files and how to correctly read them. It is also included in each one of the .zip files.