Benavent Lopez, Enrique; Corberán, Angel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchís Llopis, José María(John Wiley & Sons, 2014)
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly
service all the required edges in a windy graph. ...
Fernández de Córdoba, Pedro; García-Raffi, L. M.; Sanchís Llopis, José María(Elsevier, 1998)
[EN] The Rural Postman Problem (RPP) consists of finding a minimum cost traversal of a specified are subset of a graph. Given that the RPP is a NP-hard problem, heuristic algorithms are interesting both to handle large ...
Benavent, Enrique; Corberán, Angel; Sanchís Llopis, José María(Springer-Verlag, 2010)
[EN] In this paper we deal with the min¿max version of the windy rural postman problem with K vehicles. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of ...
Campbell, James F.; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María(John Wiley & Sons, 2018)
[EN] In this article, we present some drone arc routing problems (Drone ARPs) and study their relation with well-known postman ARPs. Applications for Drone ARPs include traffic monitoring by flying over roadways, infrastructure ...
Benavent López, Enrique; Corberan, Angel; Plana, Isaac; Sanchís Llopis, José María(John Wiley & Sons, 2009-12)
[EN] In this article the Min-Max version of the windy rural postman problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set ...
Benavent López, Enrique; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María(WILEY-BLACKWELL, 2011-11)
[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the ...
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study ...
Corberán, Angel; Mejía, Gustavo; Sanchís Llopis, José María(Institute for Operations Research and the Management Sciences, 2005-03)
[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and ...
Colombi, Marco; Corberan, Angel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María(Elsevier, 2017)
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving ...
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 ...