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

本数据集包含5个面向**带中间设施的带时间约束混合容量弧路径问题（Mixed Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities，MCARPTIF）**的基准测试集，该问题是容量限制弧路径问题（Capacitated Arc Routing Problem）的一般化推广形式。该问题可精准模拟垃圾收集调度场景，适配混合路网与可在中间设施卸载垃圾的车辆。本数据集同时包含5个仅支持双向街道的无向路网CARPTIF基准集。

每个基准集的实例文件均被压缩为单个.zip压缩包，可从下方获取下载。每个实例均为原始.txt文本文件，其文件格式由MCARPTIF_benchmark_format.pdf文档定义，该文档同样可从下方获取。基准集的完整说明由Willemse, E. J.与Joubert, J. W. (2016a)给出，同时Willemse (2016)也对这些基准集进行了详细阐述并加以使用。

Cen-IF-Full、Cen-IF、Cen-IF-part与Act-IF基准集基于真实的垃圾收集服务路网。Lpr-IF与mval-IF基准集源自http://www.uv.es/belengue/mcarp/ 公开的数据集。bccm-IF、bccm-IF-3L、gdb-IF以及gdb-IF-3L基准集源自http://www.uv.es/belengue/carp.html 公开的数据集。

Cen-IF与Lpr-IF实例首次由Willemse与Joubert (2016c)提出使用。除Cen-IF-Full与Cen-IF-part外，其余所有基准集均由Willemse与Joubert (2016b)加以使用。针对Cen-Full-IF、Cen-IF、Cen-Part-IF、Act-IF以及Lpr-IF实例，其成本数据以秒为单位，需求数据以千克为单位。其余基准实例的单位尚未明确。

参考文献：
1. Willemse, E. J. (2016). 混合路网下大规模容量限制弧路径问题的启发式算法. 比勒陀利亚大学博士论文，南非比勒陀利亚。在线配套资源可访问：http://ejwillemse.github.io/phd/
2. Willemse, E. J. and Joubert, J. W. (2016a). 面向无向路网与带中间设施的带时间约束混合容量弧路径问题的基准集. 投稿至《Data in Brief》. 在线访问地址：http://ejwillemse.github.io/057/
3. Willemse, E. J. and Joubert, J. W. (2016b). 带中间设施的带时间约束混合容量弧路径问题的构造性启发式算法. 《Computers & Operations Research》, 68:30–62. 在线配套资源可访问：http://ejwillemse.github.io/023/
4. Willemse, E. J. and Joubert, J. W. (2016c). 带中间设施的带时间约束混合容量弧路径问题的拆分策略. 投稿至《Operations Research Letters》. 在线访问地址：http://ejwillemse.github.io/045/