Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities

Willemse, Elias J.; Joubert, Johan W.

doi:10.1016/j.cor.2015.10.010

Cited by 31 publications

(27 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Centurion (Cen) MCARPTIF sets were developed in this paper and is used for computational tests in [2] , [4] .…”

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

“…Fig. 2 , taken from [2] , shows the road network of the Cen-IF-Full instance, as well as the a , b and c areas used to generate the three Cen-IF-a, Cen-IF-b and Cen-IF-c instances. The four Cen-Part-IF instances were generated by further subdividing the Cen-IF-b and Cen-IF-c instances into Cen-IF-b-1, Cen-IF-b-2, Cen-IF-c-1, and Cen-IF-c-2 instances.…”

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

“…The Lpr-IF MCARPTIF set was developed in this paper by extending the existing lpr Mixed CARP (MCARP) sets of [1] , available from http://www.uv.es/belengue/mcarp/ , and is used for computational tests in [2] , [4] . The original set consists of 15 instances with arc traversal and service costs and arc demands given in seconds and kilograms, respectively.…”

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

See 2 more Smart Citations

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

Willemse

Joubert

2016

Data in Brief

Self Cite

View full text Add to dashboard Cite

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

show abstract

“…The Centurion (Cen) MCARPTIF sets were developed in this paper and is used for computational tests in [2] , [4] .…”

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

Section: Experimental Design Materials and Methodsmentioning

confidence: 99%

See 1 more Smart Citation

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

Willemse

Joubert

2016

Data in Brief

Self Cite

View full text Add to dashboard Cite

show abstract

“…A time limit for each route is also imposed. In , the problem is defined and constructive heuristics, adapted from heuristics for the CARP or the MCARP, are tested to provide feasible solutions for the new problem. These solutions were designed to minimize not only the total cost, but also the fleet size.…”

Section: Multiple Vehicle Arc Routing Problems (K‐arps)mentioning

confidence: 99%

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

“…On a mixed network, with one and two-way streets in the case of waste collection, the problem is termed the Mixed CARPTIF (MCARPTIF), first proposed by Willemse and Joubert [13]. The problem considers a graph G G G = (V V V, E E E [ A A A), where V V V represents the set of vertices, E E E represents the set of undirected edges that may be traversed in both directions, and A A A represents the set of arcs that can only be traversed in one direction.…”

Section: Introductionmentioning

confidence: 99%

Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities

Willemse

Joubert

2016

Operations Research Letters

Self Cite

View full text Add to dashboard Cite

This paper develops optimal and quick near-optimal splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities. Splitting procedures are a key component of giant tour-based solution methods for Arc Routing Problems. The optimal and near-optimal splitting procedures are tested within a multi-start constructive heuristic, and a fixed execution-time limit is imposed. Results on benchmark instances show that the constructive-heuristic linked with the new optimal splitting algorithm performs better than the near-optimal versions.

show abstract

Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities

Cited by 31 publications

References 40 publications

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

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

An updated annotated bibliography on arc routing problems

Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities

Contact Info

Product

Resources

About