Multi-trip Multi-depot Rural Postman Problem instances

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.