Á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, ...
Ávila, Thais; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María(INFORMS (Institute for Operations Research and Management Sciences), 2016-05)
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an
arc routing problem with some interesting real-life applications, such as routing for meter reading. In this
article ...
Á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 ...
Á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 ...
Á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 ...