Ávila, Thais; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María(INFORMS (Institute for Operations Research and Management Sciences), 2016-05)
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an
arc routing problem with some interesting real-life applications, such as routing for meter reading. In this
article ...
Corberán, Ángel; Eglese, Richard; Hasle, Geir; Plana, Isaac; Sanchís Llopis, José María(John Wiley & Sons, 2021-01)
[EN] 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, ...
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 ...
Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(Springer-Verlag, 2022-09)
[EN] The Length Constrained K¿Drones Rural Postman Problem (LC K¿DRPP) is a continuous
optimization problem where a set of curved or straight lines of a network
have to be traversed, in order to be serviced, by a fleet ...
Campbell, James F.; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(Elsevier, 2021-07-01)
[EN] In this paper we address the Length Constrained K-Drones Rural Postman Problem (LC K-DRPP). This is a continuous optimization problem where a fleet of homogeneous drones have to jointly service (traverse) a set of ...
Corberán, Ángel; Erdogan, Gunes; Laporte, Gilbert; Plana, Isaac; Sanchís Llopis, José María(Institute for Operations Research and the Management Sciences, 2018)
[EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of ...
Colombi, Marco; Corberán, Ángel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María(Institute for Operations Research and the Management Sciences, 2017)
[DE] In this paper, we study a generalization of the Hierarchical Chinese Postman Problem on a mixed graph where only a subset of arcs and edges require a service to be accomplished following a hierarchical order. The ...
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, ...
Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(John Wiley & Sons, 2023-12)
[EN] In this article, we present and solve the multi-pur pose K-drones general routing problem (MP K-DGRP). In this optimization problem, a fleet of multi-pur pose drones, aerial vehicles that can both make deliveries and ...
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 ...
Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(Elsevier, 2024-02)
[EN] The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum ...