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. ...
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, ...
Archetti, Claudia; Corberan, Angel; Plana, Isaac; Sanchís Llopis, José María; Speranza, M. G.(Elsevier, 2015-09-01)
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit.
A limited fleet of vehicles is available ...
Á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 ...
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 ...
Ávila, Thais; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María(Springer-Verlag, 2017)
[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through ...
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 ...
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; 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 ...
Colombi, Marco; Corberán, Angel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María(Elsevier, 2017)
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes ...
Ávila, Thais; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María(John Wiley & Sons, 2015)
[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node ...
Archetti, Claudia; Speranza, M. Grazia; Corberan, Angel; Sanchís Llopis, José María; Plana, Isaac(INFORMS (Institute for Operations Research and Management Sciences), 2014-08)
The team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, ...