- -

Listar por palabra clave "Close-enough arc routing problem"

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Listar por palabra clave "Close-enough arc routing problem"

Ordenar por:Orden:Resultados:

  • Icon
    A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem 
    Á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 ...
  • thumb
    Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem 
    Á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 ...
  • thumb
    The min-max close-enough arc routing problem 
    Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchís Llopis, José María (Elsevier, 2022-08-01)
    [EN] Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, ...