Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities
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...
Main Authors: | Elias J. Willemse, Johan W. Joubert |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2016-09-01
|
Series: | Data in Brief |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2352340916304358 |
Similar Items
-
Heuristics for large-scale Capacitated Arc Routing Problems on mixed networks
by: Willemse, Elias J.
Published: (2016) -
Heuristic algorithms for dynamic capacitated arc routing
by: Padungwech, Wasin
Published: (2018) -
The Study of Lower Bound of Capacitated Arc Routing Problem
by: Chia-Nan Su, et al.
Published: (1999) -
An Iterated Local Search for the Periodic Capacitated Arc Routing Problem
by: Li-Chun Lu, et al.
Published: (2018) -
A Benchmark Dataset and Deep Learning-Based Image Reconstruction for Electrical Capacitance Tomography
by: Jin Zheng, et al.
Published: (2018-10-01)