- -

A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem

Show simple item record

Files in this item

dc.contributor.author Benavent Lopez, Enrique es_ES
dc.contributor.author Corberán, Angel es_ES
dc.contributor.author Desaulniers, Guy es_ES
dc.contributor.author Lessard, François es_ES
dc.contributor.author Plana, Isaac es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2018-07-06T07:18:05Z
dc.date.available 2018-07-06T07:18:05Z
dc.date.issued 2014 es_ES
dc.identifier.issn 0028-3045 es_ES
dc.identifier.uri http://hdl.handle.net/10251/105402
dc.description.abstract [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. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented. es_ES
dc.description.sponsorship Contract grant sponsor: Ministerio de Education y Ciencia of Spain: Contract gram number: MTM2006-14961-C05-02 Canadian Natural Sciences and Engineering Research Council; Contract grant number: 157935-07
dc.language Inglés es_ES
dc.publisher John Wiley & Sons es_ES
dc.relation MICINN/MTM2009-14039-C06-02 es_ES
dc.relation MINECO/MTM2012-36163-C06-02 es_ES
dc.relation NSERC/157935-07
dc.relation.ispartof Networks es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Rural postman problem es_ES
dc.subject Windy rural postman problem es_ES
dc.subject Multivehicle es_ES
dc.subject Column generation es_ES
dc.subject Branch-and-price es_ES
dc.subject Cutting planes es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1002/net.21520 es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada es_ES
dc.description.bibliographicCitation Benavent López, E.; Corberán, A.; Desaulniers, G.; Lessard, F.; Plana, I.; Sanchís Llopis, JM. (2014). A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem. Networks. 63(1):34-45. doi:10.1002/net.21520 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1002/net.21520 es_ES
dc.description.upvformatpinicio 34 es_ES
dc.description.upvformatpfin 45 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 63 es_ES
dc.description.issue 1 es_ES
dc.relation.pasarela 256985 es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación (MICINN) es_ES
dc.contributor.funder Ministerio de Economía y Competitividad (MINECO) es_ES
dc.contributor.funder Natural Sciences and Engineering Research Council of Canada (NSERC)


This item appears in the following Collection(s)

Show simple item record