Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Arc routing"

Mostrando ítems 1-9 de 9

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 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 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 ...
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, ...
New Heuristic Algorithms for the Windy Rural Postman Problem

Benavent, E.; Corberán, A.; Piñana, E.; Plana. I.; Sanchís Llopis, José María (Elsevier, 2005)

[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 ...
New results on the Windy Postman Problem

Corberán, Angel; Oswald, Marcus; Plana, Isaac; Reinelt, Gerhard; Sanchís Llopis, José María (Springer-Verlag, 2012-04)

[EN] In this paper, we study the Windy Postman Problem (WPP). This is a well-known Arc Routing Problem that contains the Mixed Chinese Postman Problem (MCPP) as a special case. We extend to arbitrary dimension some new ...
Solving the length constrained K-drones rural postman problem

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 ...
The Profitable Close-Enough Arc Routing Problem

Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2022-04)

[EN] In this article, we deal with the Profitable Close-Enough Arc Routing Problem (PCEARP), which is an extension of the Close-Enough ARP (CEARP). The CEARP models the situation in which customers are not necessarily nodes ...
The Windy Clustered Prize-Collecting Arc-Routing Problem

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