具有中间设施的时间限制下无向和混合容量弧路由问题的基准数据集
Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities.
作者信息
Willemse Elias J, Joubert Johan W
机构信息
Center of Transport Development, Department of Industrial and Systems Engineering, University of Pretoria, 0002, South Africa.
出版信息
Data Brief. 2016 Jul 6;8:972-7. doi: 10.1016/j.dib.2016.06.067. eCollection 2016 Sep.
In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to benchmark different solution approaches for the MCARPTIF. An in-depth description of the datasets can be found in "Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities" (Willemseand Joubert, 2016) [2] and "Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemseand Joubert, in press) [4]. The datasets are publicly available from "Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemse and Joubert, 2016) [3].
在本文中，我们展示了带时间限制和中间设施的混合容量弧路由问题（MCARPTIF）的基准数据集。该问题是容量弧路由问题（CARP）的推广，并且紧密代表废物收集路线规划。我们展示了四个不同的测试集，每个测试集由多个实例文件组成，可用于对MCARPTIF的不同求解方法进行基准测试。数据集的详细描述可在《带时间限制和中间设施的混合容量弧路由问题的构造启发式算法》（Willemse和Joubert，2016年）[2]以及《带时间限制和中间设施的混合容量弧路由问题的拆分程序》（Willemse和Joubert，即将发表）[4]中找到。这些数据集可从《带时间限制和中间设施的容量弧路由问题变体的基准测试集库》（Willemse和Joubert，2016年）[3]中公开获取。
Zotero 插件