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 ...
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 ...
Á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 ...
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, ...
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 ...
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 ...
Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(John Wiley & Sons, 2023-12)
[EN] In this article, we present and solve the multi-pur pose K-drones general routing problem (MP K-DGRP). In this optimization problem, a fleet of multi-pur pose drones, aerial vehicles that can both make deliveries and ...
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 ...
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. ...
Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula(Elsevier, 2024-02)
[EN] The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum ...