Benchmark sets for variants of the Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities

The dataset contains 5 benchmark test sets for the Mixed Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities (MCARPTIF), which is a generalisation of the Capacitated Arc Routing Problem. The problem closely represents waste collection routing and caters for mixed road networks and vehicles unloading their waste at Intermediate Facilities. The dataset also contains 5 CARPTIF sets with undirected networks that only have two-way streets. The benchmark instance files of each set was compressed into a single .zip file, available for download below. Each instance file is a raw .txt file. The format of each file is given by the MCAPRTIF_benchmark_format.pdf file, also available below. Full descriptions of the benchmark sets is given by Willemse, E. J. and Joubert, J. W. (2016a). The sets are also extensively described and used by Willemse (2016). The Cen-IF-Full, Cen-IF, Cen-IF-part and Act-IF sets are based on real road networks requiring waste collection services. The Lpr-IF and mval-IF sets were derived from the sets available from uv.es. The bccm-IF, bccm-IF-3L, gdb-IF, and gdb-IF-3L sets were derived from sets available from uv.es. The Cen-IF and Lpr-IF instances were first used by Willemse & Joubert (2016c). All the other sets, except for Cen-IF-Full and Cen-IF-part, were used by Willemse & Joubert (2016b). For the Cen-Full-IF, Cen-IF, Cen-Part-IF, Act-IF and Lpr-IF instances, cost data are given in seconds, and demand data in killograms. The units for the other benchmark instances are not known. References: Willemse, E. J. (2016). Heuristics for large-scale Capacitated Arc Routing Problems on mixed networks. PhD thesis, University of Pretoria, Pretoria, South Africa. Online companion available at ejwillemse.github.io Willemse, E. J. and Joubert, J. W. (2016a). Benchmark sets for undirected and Mixed Capacitated Arc Routing Problems under Time Restrictions with Intermediate Facilities. Submitted to Data in Brief. Available online from ejwillemse.github.io Willemse, E. J. and Joubert, J. W. (2016b). Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities. Computers & Operations Research, 68:30–62. Online companion available at ejwillemse.github.io Willemse, E. J. and Joubert, J. W. (2016c). Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities. Submitted to Operations Research Letters. Available online from ejwillemse.github.io