Corberán, A.; Plana, I.; Sanchís Llopis, José María(John Wiley & Sons, 2007-07)
[EN] In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut ...
Corberán, Angel; Plana, Isaac; Rodríguez-Chía, Antonio Manuel; Sanchís Llopis, José María(Springer-Verlag, 2013-10)
[EN] The Maximum Benefit Chinese Postman Problem (MBCPP) is an NP-hard problem that considers several benefits associated with each edge, one for each time the edge is traversed with a service. The objective is to find a ...
Archetti, C.; Corberán, A.; Plana, I.; Sanchís Llopis, José María; Speranza, M.G.(Elsevier, 2016)
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified.
In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be
serviced, ...
Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, José María(Elsevier, 2016-03-16)
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, ...
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.; Mota, E.; Sanchís Llopis, José María(Elsevier, 2006-12)
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding ...
Corberan, Angel; Letchford, Adam; Sanchís Llopis, José María(Springer-Verlag, 2001)
[EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural ...
Corberán, A.; Marti, R.; Sanchís Llopis, José María(Elsevier, 2002)
[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed ...
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 ...
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, ...
Corberan, A.; Sanchís Llopis, José María(Elsevier, 1994)
[EN] In this paper we study the polyhedron associated with the Rural Postman Problem (RPP). Because the RPP is NP-hard, we cannot expect to find a complete description of the rural postman polyhedron of a general graph, ...
Fernández de Córdoba, Pedro; García-Raffi, L. M.; Mayado, A.; Sanchís Llopis, José María(Springer-Verlag, 2000)
[EN] In this paper we use Monte Carlo Techniques to deal with a real world delivery problem of a food company in Valencia (Spain). The problem is modeled as a set of 11 instances of the well known Vehicle Routing Problem, ...
Albiach, José; Sanchís Llopis, José María; Soler Fernández, David(Elsevier, 2008)
[EN] In this paper we deal with an extended version of the Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW) that considers time-dependent travel times and costs, for a more accurate approximation of some ...
Ávila, Thais; Corberán, A.; PLANA, ISAAC; Sanchís Llopis, José María(Springer-Verlag, 2012)
[EN] In this paper we propose a metaheuristic algorithm for the
Stacker Crane Problem. This is an NP-hard arc routing problem whose
name derives from the practical problem of operating a crane. Here we
present a formulation ...
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 ...
[EN] In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very ...
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 ...