The Generalized Arc Routing Problem

Aráoz, Julián; Fernández, Elena; Franquesa, Carles

doi:10.1007/s11750-017-0437-4

Cited by 12 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eglese et al [83] present a very interesting survey of meter reading applications, including the historical evolution of the associated problems and the proposed solution approaches. Other potential applications are mentioned in Araoz et al [11] and are related to quality control for networks maintenance, where only a small subset of the links of a network has to be traversed.…”

Section: Close Enough (Or Generalized) Arpsmentioning

confidence: 99%

“…If in the CEARP we consider the links covering each customer as a subset of the network links, the CEARP is equivalent to the generalized RPP introduced and studied by Drexl in [73,74]. The CEARP is also related to the generalized arc routing problem defined in Araoz et al [11], but both problems differ in that in the CEARP the subsets of links associated with the service of the customers do not need to be disjoint nor to induce a connected graph.…”

Section: Current State Of Knowledge and Future Developments In Relevamentioning

confidence: 99%

See 1 more Smart Citation

Arc routing problems: A review of the past, present, and future

et al. 2020

View full text Add to dashboard Cite

Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applications.

show abstract

Section: Close Enough (Or Generalized) Arpsmentioning

confidence: 99%

Section: Current State Of Knowledge and Future Developments In Relevamentioning

confidence: 99%

Arc routing problems: A review of the past, present, and future

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Aráoz et al also focus on the GRPP on undirected networks. This paper culminates the work that has been developed and presented in some worldwide conferences, from ROUTE 2011 or IFORS 2011 to WARP1 or TRISTAN 2013 .…”

Section: Single Vehicle Arc Routing Problemsmentioning

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

“…The Generalized Arc Routing Problem is an undirected version of the CEARP where the clusters of edges associated with the customers are pairwise-disjoint connected subgraphs. This problem, which can be seen as the arc routing counterpart of the Generalized Traveling Salesman Problem, is studied by Aráoz et al [1], who describe some facets and valid inequalities for the problem and present a branch-and-cut algorithm for its solution.…”

Section: Introductionmentioning

confidence: 99%

“…Like in meter reading, "the robot must be physically within its effective range". Aráoz et al [1] also note that another area of application is in quality control for networks maintenance, where only a small subset of the edges of a network has to be traversed. The same authors argue that the CEARP is the most appropriate problem for modeling location/arc routing problems in which facilities have to be located at some given areas and connected among them by means of a route.…”

Section: Introductionmentioning

confidence: 99%