Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Sanchís Llopis, José María"

Mostrando ítems 1-20 de 39

Página siguiente

A Branch & Cut algorithm for the Windy General Routing Problem and Special Cases

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 ...
A branch-and-cut algorithm for the maximum benefit Chinese postman problem

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 ...
A branch-and-cut algorithm for the Orienteering Arc Routing Problem

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, ...
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

Á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, ...
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

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. ...
A comparison of two different formulations for Arc Routing Problems on Mixed graphs

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 ...
A cutting plane algorithm for the General Routing Problem

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 ...
A GRASP for the Mixed Postman Problem

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 ...
A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem

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 ...
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

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, ...
A polyhedral approach to the Rural Postman Problem

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, ...
A real delivery problem dealt with Monte Carlo techniques

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, ...
Aesthetic considerations for the min-max K-Windy Rural Postman Problem

Corberán, A.; Golden, Bruce; Lum, Oliver; PLANA, ISAAC; Sanchís Llopis, José María (John Wiley & Sons, 2017-10)

[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal ...
An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation

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 ...
An ILS-Based Metaheuristic for the Stacker Crane Problem

Á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 ...
Arc routing problems: A review of the past, present, and future

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, ...
Drone arc routing problems

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 ...
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

Á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 ...
Lower bounds and heuristics for the Windy Rural Postman Problem

Benavent, E.; Carrotta, A.; Corberán, A.; Sanchís Llopis, José María; Vigo, D. (Elsevier, 2020-01-16)

[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 ...
Min-Max K-vehicles Windy Rural Postman Problem

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 ...