Corberán, A.; PLANA, ISAAC; Reula, Miguel; Sanchís Llopis, José María(Springer-Verlag, 2019-07)
[EN] The Close-Enough Arc Routing Problem, also called Generalized Directed Rural Postman Problem, is an arc routing problem with interesting real-life applications, such as routing for meter reading. In this application, ...
Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María(Elsevier, 2021-05-16)
[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman ...
Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María(Elsevier, 2022-08-01)
[EN] Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, ...
Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María(Elsevier, 2022-04)
[EN] In this article, we deal with the Profitable Close-Enough Arc Routing Problem (PCEARP), which is an extension
of the Close-Enough ARP (CEARP). The CEARP models the situation in which customers are not necessarily
nodes ...