Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities

Published: 7 Jun 2016 | Version 2 | DOI: 10.17632/9x4vd92rcj.2
Contributor(s):

Description of this data

Please use the accompanying article of Willemse, E. J. and Joubert, J. W. (2016a) to site any of the datasets.

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 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.

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 http://www.uv.es/belengue/mcarp/. The bccm-IF, bccm-IF-3L, gdb-IF, and gdb-IF-3L sets were derived from sets available from http://www.uv.es/belengue/carp.html.

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 http://ejwillemse.github.io/phd/

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 http://ejwillemse.github.io/057/

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 http://ejwillemse.github.io/023/

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 http://ejwillemse.github.io/045/

Experiment data files

Steps to reproduce

Act-IF:

The Act-IF dataset was derived from a case study reported by Willemse & Joubert (2016b). The dataset was created using OpenStreetMap data and information supplied by the local waste collection authority. It is therefore not available for direct reproduction.

Cen-Full-IF, Cen-IF and Cen-Part-IF:

A Geospatial Information System (GIS) data set of the Centurion area, courtesy of Business Connexion, was used to create three benchmark instances. The data set accurately describes the network and includes a number of useful attributes. Accurate deadheading costs, service costs and waste quantities are not available for the network, so we inferred the arc-routing data using a similar approach to that of Belenguer et al. (2006). The original road network was obtained through Business Connexion is not available publicly, and therefore not available for direct reproduction.

Lpr-IF and mval-IF-3L:

The datasets were developed by extending the lpr and mval datasets (available from http://www.uv.es/belengue/mcarp/) introduced by Belenguer et al (2006). The original instances were randomly generated by the authors and can therefore not be directly reproduced. For the modification of Lpr to the Lpr-IF, a route duration restriction of 28800 seconds (8 hours) was imposed on each instance, and two IF facilities were located at floor(nVertices/2) and 2xfloor(nVertices/2). For the mval to mval-IF-3L conversion, IFs were located and route duration restrictions were imposed as shown in the mval-IF-3L raw data files. All the Lpr-IF and mval-IF-3L files can be reproduced by imposing the same restrictions and IF locations contained in the modified files on the the original mval and lpr instance files.

gdb-IF and bccm-IF:

The datasets were developed by extending the gdb and bccm datasets (available from http://www.uv.es/belengue/carp.html). All the instance files can be reproduced by imposing the same restrictions and IF locations contained in the modified files on the the original gdb and bccm instance files.

gdb-IF-3L and bccm-IF-3L:

The datasets are almost identical to the gdb-IF and bccm-IF sets, the only difference being that the route duration restriction was multiplied by a factor of 3. All the instance files can be reproduced by imposing the same restrictions and IF locations contained in the modified files on the the original gdb and bccm instance files.

References:

Belenguer, J., Benavent, E., Lacomme, P., and Prins, C. (2006). Lower and upper bounds for the mixed capacitated arc routing problem. Computers & Operations Research, 33(12):3363–3383.

Related links

This data is associated with the following publication:

Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities

Published in: Data in Brief

Latest version

Statistics

Views: 339
Downloads: 43

Previous versions

  • Version 2

    2016-06-07

    Published: 2016-06-07

    DOI: 10.17632/9x4vd92rcj.2

    Cite this dataset

    Willemse, Elias; Joubert, Johan W. (2016), “Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities”, Mendeley Data, v2 http://dx.doi.org/10.17632/9x4vd92rcj.2

  • Version 1

    2016-05-19

Compare to version

Institutions

University of Pretoria

Categories

Vehicle Routing Problem, Benchmarking

Licence

CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?

This dataset is licensed under a Creative Commons Attribution 4.0 International licence. What does this mean? You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.

Report