Multi-trip Multi-depot Rural Postman Problem instances

Citation Author(s):
Eashwar
Sathyamurthy
Submitted by:
Eashwar Sathyamurthy
Last updated:
Sun, 06/25/2023 - 21:00
DOI:
10.21227/qtgh-sm74
Data Format:
Link to Paper:
License:
0
0 ratings - Please login to submit your rating.

Abstract 

The dataset consists of undirected weighted multi-graphs stored in .pkl or .net formats. These undirected graphs form instances for the multi-trip multi-depot rural postman problem. The Multi-trip multi-depot Rural Postman Problem is a variant of the Capacitated Arc Routing Problem which is to find a set of routes for vehicles having limited capacity to traverse a set of arcs from a node called depot in an undirected graph in the least possible time. The dataset consists of instances generated by modifying instances from the literature and also real-world road networks. The graph stored in .pkl or .net format can be accessed using the main.py python file.

Instructions: 

cd multi-trip multi-depot RRP instances/src
python main.py

Comments

Dear Mr Sathyamurthy,

It would be of great importance for me, if I can get access to this dataset as it is related to my master`s thesis.

Submitted by Katarina Dajic on Tue, 07/11/2023 - 19:01

Hi, I am new to IEEE Dataport. Is there a problem accessing my dataset? You can download the dataset .zip file right?

Submitted by Eashwar Sathyamurthy on Tue, 07/11/2023 - 19:26