Arc Routing Problems: Data Instances

In this webpage you can find data for different types of Arc Routing Problems defined on undirected, mixed and windy graphs.

The results for the Min-Max K-vehicles WRPP instances have been obtained with the algorithms described in Benavent, Corberán, Plana and Sanchis (Min-Max K-vehicles Wind Rural Postman Problem, Networks, Vol. 54(4), pp. 216-226, 2009 and New Facets and an enhanced Branch-and-Cut for the Min-Max K-vehicles Windy Rural Postman Problem, Networks, to appear).

The results for the MBCPP instances have been obtained with the algorithm described in Corberán, Plana. Rodríguez-Chía and Sanchis (A New Approach to the Maximum Benefit Chinese Postman Problem, submitted).

The results for all the other instances have been obtained with the Branch & Cut algorithms described in Corberán, Plana and Sanchis (A Branch & Cut Algorithm for the Windy General Routing Problem and special cases, Networks 49, pp. 245-257, 2007) and in Corberán, Oswald, Plana, Reinelt and Sanchis (New results on the Windy Postman Problem, Mathematical Programming, DOI 10.1007/s10107-010-0399-x (Published online 10/08/2010)).

All the results are reported in the files linked in column Solutions. The characteristics of the instances can be found in column Instance characteristics.

For more details about the instances, read the file readme.txt .