RiuNet UPV Home
:
Browsing by Author

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Author "Sanchís Llopis, José María"

Now showing items 21-33 of 33

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 ...
New Results on the Mixed General Routing Problem

Corberán, Angel; Mejía, Gustavo; Sanchís Llopis, José María (Institute for Operations Research and the Management Sciences, 2005-03)

[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and ...
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 ...
On the Distance-Constrained Close Enough Arc Routing Problem

Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2021-05-16)

[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman ...
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 directed profitable rural postman problem with incompatibility constraints

Colombi, Marco; Corberan, Angel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María (Elsevier, 2017)

[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving ...
The Hierarchical Mixed Rural Postman Problem

Colombi, Marco; Corberán, Ángel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María (Institute for Operations Research and the Management Sciences, 2017)

[DE] In this paper, we study a generalization of the Hierarchical Chinese Postman Problem on a mixed graph where only a subset of arcs and edges require a service to be accomplished following a hierarchical order. The ...
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm

Colombi, Marco; Corberán, Angel; Mansini, Renata; Plana, Isaac; Sanchís Llopis, José María (Elsevier, 2017)

[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes ...
The mixed general routing polyhedron

Corberán, Angel; Romero Rozalén, Antonio; Sanchís Llopis, José María (Springer-Verlag, 2003)

[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most ...
The stacker crane problem and the directed general routing problem

Ávila, Thais; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2015)

[EN] This article deals with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP contains a large number of important arc and node ...
The Windy General Routing Polyhedron: A global view of many known Arc Routing Polyhedra

Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (Society for Industrial and Applied Mathematics, 2008-03-21)

[EN] The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. ...
Zigzag inequalities:a new class of facet-inducing inequalities for Arc Routing Problems

Corberán, A.; Plana, I.; Sanchís Llopis, José María (Springer-Verlag, 2006-08)

[EN] In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off ...