- -

Browsing by Author "Plana, Isaac"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Author "Plana, Isaac"

Sort by: Order: Results:

  • thumb
    A branch-and-cut algorithm for the maximum benefit Chinese postman problem 
    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 ...
  • Icon
    Aesthetic considerations for the min-max K-Windy Rural Postman Problem 
    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 ...
  • Icon
    An ILS-Based Metaheuristic for the Stacker Crane Problem 
    Á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 ...
  • thumb
    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, ...
  • thumb
    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 ...
  • thumb
    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 ...
  • thumb
    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. ...