Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Windy rural postman problem"

Mostrando ítems 1-7 de 7

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 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 metaheuristic for the min-max Windy Rural Postman Problem with K vehicles

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 ...
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 ...
New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem

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