- -

A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: Sanchís - A new ...
Tamaño: 1.531Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
Thumbnail
Nombre: DCEARP revised.pdf
Tamaño: 284.2Kb
Formato: PDF
Descripción: Versión de autor
Abrir
dc.contributor.author Ávila, Thais es_ES
dc.contributor.author Corberán, Ángel es_ES
dc.contributor.author Plana, Isaac es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2017-06-30T10:00:27Z
dc.date.available 2017-06-30T10:00:27Z
dc.date.issued 2016-05
dc.identifier.issn 0041-1655
dc.identifier.uri http://hdl.handle.net/10251/84205
dc.description.abstract 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 we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods es_ES
dc.description.sponsorship The authors wish to thank Minh Hoang Ha, Nathalie Bostel, Andre Langevin, and Louis-Martin Rousseau for providing their instances. The authors also thank the Spanish Ministerio de Economia y Competitividad [project MTM2012-36163-C06-02] and the Generalitat Valenciana [project GVPROMETEO2013-049] for their support. en_EN
dc.language Inglés es_ES
dc.publisher INFORMS (Institute for Operations Research and Management Sciences) es_ES
dc.relation.ispartof Transportation Science es_ES
dc.rights Reconocimiento - No comercial (by-nc) es_ES
dc.subject Generalized rural postman problem es_ES
dc.subject Close-enough arc routing problem es_ES
dc.subject Branch-and-cut es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1287/trsc.2015.0588
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//MTM2012-36163-C06-02/ES/MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/ es_ES
dc.rights.accessRights Abierto 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 Ávila, T.; Corberán, Á.; Plana, I.; Sanchís Llopis, JM. (2016). A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem. Transportation Science. 50(2):750-761. https://doi.org/10.1287/trsc.2015.0588 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://doi.org/10.1287/trsc.2015.0588 es_ES
dc.description.upvformatpinicio 750 es_ES
dc.description.upvformatpfin 761 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 50 es_ES
dc.description.issue 2 es_ES
dc.relation.senia 325759 es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES
dc.contributor.funder Generalitat Valenciana es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem