- -

Listar por palabra clave "Multivehicle"

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

Listar por palabra clave "Multivehicle"

Ordenar por:Orden:Resultados:

  • Icon
    A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem 
    Benavent Lopez, Enrique; Corberán, Angel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2014)
    [EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. ...
  • 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
    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 ...
  • thumb
    The Team Orienteering Arc Routing Problem 
    Archetti, Claudia; Speranza, M. Grazia; Corberan, Angel; Sanchís Llopis, José María; Plana, Isaac (INFORMS (Institute for Operations Research and Management Sciences), 2014-08)
    The team orienteering arc routing problem (TOARP) is the extension to the arc routing setting of the team orienteering problem. In the TOARP, in addition to a possible set of regular customers that have to be serviced, ...