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 ...
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 ...
Á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; 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 ...
Corberán, A.; Sanchís Llopis, José María(Elsevier, 1998)
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical ...
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, ...
Corberan, Ángel; Fernandez, Elena; Franquesa, Carles; Sanchís Llopis, José María(INFORMS (Institute for Operations Research and Management Sciences), 2011)
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent ...