Data

Tools

Indexes

Applications

Experiments

Open Source Science

spdvrp-cd

Test instances for the Split Pick-up and Delivery Vehicle Routing Problem with Cross-Docks

https://github.com/mmflynn/spdvrp-cd

Science Score: 44.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ✓
    CITATION.cff file
    Found CITATION.cff file
  • ✓
    codemeta.json file
    Found codemeta.json file
  • ✓
    .zenodo.json file
    Found .zenodo.json file
  • ○
    DOI references
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (5.8%) to scientific vocabulary
Last synced: 10 months ago · JSON representation ·

Repository

Test instances for the Split Pick-up and Delivery Vehicle Routing Problem with Cross-Docks

Basic Info
  • Host: GitHub
  • Owner: mmflynn
  • License: gpl-3.0
  • Default Branch: main
  • Size: 445 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created almost 3 years ago · Last pushed about 1 year ago
Metadata Files
Readme License Citation

README.md

SPDVRP-CD

Test instances for the Split Pick-up and Delivery Vehicle Routing Problem with Cross-Docks

This repro contains the data for the instances considered in our Thesis paper.

Each the filenames shows the structure of the instance with the following encoding S=aD=bX=c(d)_e.csv,

Where, a is the number of supplier vertices b is the number of delivery vertices c is the number of cross-dock vertices d is the number of cross-dock vertices that can receive a delivery (these are additional to those in c) e is the number of orders.

Each file is stuctured in 5 blocks with the first 3 being location definitions all having a common format Site (i.e. Cross-dock), Suppler, and Destination Identifier, X coordinate, Y coordinate, vertex number

The fourth group defines the orders in the format Source, destination, volume, earliest collection time, latest delivery time, count

The final block defines a basic set of routes that allows a feasible solution. The format of these routes is Route Id, python list of vertices visited.

A support file in the format S=aD=bX=c(d)e.0150%.1w.csv, has a modified version of the orders in S=aD=bX=c(d)e.csv with tighter time windows.

Owner

  • Name: Michael Flynn
  • Login: mmflynn
  • Kind: user
  • Location: UK

Citation (CITATION.cff) 

cff-version: 1.2.0
message: "If you use these test instance, please cite it as below."
authors:
- family-names: "Flynn"
  given-names: "Michael"
  orcid: "https://orcid.org/0000-0002-0642-2760"
title: "Test instances for SPDVRP-CD"
version: 1.0
date-released: 2024-01-01
url: "https://github.com/mmflynn/SPDVRP-CD"

GitHub Events

Total
  • Push event: 1
Last Year
  • Push event: 1