Multiple time window VRP dataset

Explanation of the Multi-Time Windows Dataset for the Vehicle Routing Problem with Time Windows Dataset

Introduction

This document provides an overview of the newly created dataset that extends the classic Solomon benchmark instances for the Vehicle Routing Problem with Time Windows (VRPTW). The dataset introduces multiple time windows for each customer, enhancing the realism and applicability of routing algorithms in logistics and supply chain management.

Dataset Structure

The dataset consists of six CSV files, each corresponding to a specific problem type from the original Solomon datasets. Each file contains data for 100 customers, including the depot, and includes the following columns:

• CUST_NO: Customer ID (0 represents the depot)
• XCOORD: X-coordinate of the customer's location
• YCOORD: Y-coordinate of the customer's location
• DEMAND: The demand of the customer (in units)
• READY_TIME_1: Start time of the first time window
• DUE_TIME_1: End time of the first time window
• READY_TIME_2: Start time of the second time window
• DUE_TIME_2: End time of the second time window
• READY_TIME_3: Start time of the third time window
• DUE_TIME_3: End time of the third time window

Example of the New Dataset

The following table illustrates a sample of the new dataset, showing the first six customers, including the depot:

Original Solomon Dataset Analysis

The following table summarizes the analysis of the original Solomon datasets, highlighting key metrics for each problem type: