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

Please use the following article when siting the Cen-IF or Lpr-IF datasets: Willemse, E. J. and Joubert, J. W. (2016a). Benchmark dataset for undirected and mixed capacitated arc routing problems under time restrictions with intermediate facilities. Data in Brief, 8:972–977, DOI: 0.1016/j.dib.2016.06.067. Please use the following article when siting any of the other datasets: 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. The sets are also extensively used and described in: Willemse, E. J. and Joubert, J. W. (2016c). Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities. Operations Research Letters, 44(5):569–574. Willemse, E. J. (2016). Heuristics for large-scale Capacitated Arc Routing Problems on mixed networks. PhD thesis, University of Pretoria, Pretoria. Available online from http://hdl.handle.net/2263/57510 (Last viewed on 2017-01-16) 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.引用Cen-IF或Lpr-IF数据集时，请使用以下文献： Willemse, E. J. 与 Joubert, J. W. (2016a). 带中间设施且受时间约束的无向混合容量弧路径问题基准数据集[J]. 数据简报(Data in Brief), 8:972–977, DOI: 10.1016/j.dib.2016.06.067. 引用其余任意数据集时，请使用以下文献： Willemse, E. J. 与 Joubert, J. W. (2016b). 带中间设施且受时间约束的混合容量弧路径问题构造启发式算法[J]. 计算机与运筹学(Computers & Operations Research), 68:30–62. 上述数据集还在以下文献中得到了广泛使用与详细说明： Willemse, E. J. 与 Joubert, J. W. (2016c). 带中间设施且受时间约束的混合容量弧路径问题拆分策略[J]. 运筹学快报(Operations Research Letters), 44(5):569–574. Willemse, E. J. (2016). 混合网络下大规模带容量约束弧路径问题的启发式算法[D]. 比勒陀利亚大学(University of Pretoria), 比勒陀利亚。可从http://hdl.handle.net/2263/57510 在线获取（最后访问时间：2017-01-16） 本数据集包含5组针对带中间设施且受时间约束的混合容量弧路径问题（Mixed Capacitated Arc Routing Problem under Time Restrictions with Intermediate Facilities, MCARPTIF）的基准测试集，该问题是带容量约束弧路径问题（Capacitated Arc Routing Problem, CARP）的泛化形式。该问题可精准模拟垃圾收集路径规划场景，适配混合道路网络与可在中间设施卸载垃圾的车辆。本数据集还包含5组仅含双向街道的无向网络CARPTIF测试集。 每组测试集的基准实例文件均压缩为单个.zip压缩包，可从下方下载。每个实例文件均为原始.txt文本文件。各文件的格式详见下方提供的MCAPRTIF_benchmark_format.pdf文件。 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实例，其成本数据以秒为单位，需求数据以千克为单位。其余基准测试实例的单位未明确说明。