- -

The Windy Clustered Prize-Collecting Arc-Routing Problem

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

The Windy Clustered Prize-Collecting Arc-Routing Problem

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: JMSanchis_Transpo ...
Tamaño: 316.5Kb
Formato: PDF
Descripción: Versión editor
Solicitar una copia al autor
dc.contributor.author Corberan, Ángel es_ES
dc.contributor.author Fernandez, Elena es_ES
dc.contributor.author Franquesa, Carles es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2013-06-26T06:56:44Z
dc.date.available 2013-06-26T06:56:44Z
dc.date.issued 2011
dc.identifier.issn 0041-1655
dc.identifier.uri http://hdl.handle.net/10251/30119
dc.description.abstract This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS. es_ES
dc.description.sponsorship The authors thank the Ministerio de Educacion y Ciencia of Spain ( Projects MTM2009-14039-C06-02 and MTM2009-14039-C06-05) for its support. They also thank the associate editor and three anonymous referees for their careful reading of the manuscript and for their many comments and suggestions that contributed significantly to improving it. 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 Reserva de todos los derechos es_ES
dc.subject Arc routing es_ES
dc.subject Cutting plane algorithms es_ES
dc.subject Polyhedral modelling es_ES
dc.subject Arc routing problems es_ES
dc.subject Computational experiment es_ES
dc.subject Numerical results es_ES
dc.subject Prize-collecting es_ES
dc.subject Separation problems es_ES
dc.subject Valid inequality es_ES
dc.subject Profitability es_ES
dc.subject Mathematical programming es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title The Windy Clustered Prize-Collecting Arc-Routing Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1287/trsc.1110.0370
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-02/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/ / es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-05/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/ / 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 Corberan, Á.; Fernandez, E.; Franquesa, C.; Sanchís Llopis, JM. (2011). The Windy Clustered Prize-Collecting Arc-Routing Problem. Transportation Science. 45(3):317-334. doi:10.1287/trsc.1110.0370 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1287/trsc.1110.0370 es_ES
dc.description.upvformatpinicio 317 es_ES
dc.description.upvformatpfin 334 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 45 es_ES
dc.description.issue 3 es_ES
dc.relation.senia 211868
dc.identifier.eissn 1526-5447
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES


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

Mostrar el registro sencillo del ítem