- -

The min-max close-enough arc routing problem

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

The min-max close-enough arc routing problem

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: BianchessiCorbera ...
Tamaño: 1.110Mb
Formato: PDF
Descripción: Versión editorial
Abrir
dc.contributor.author Bianchessi, Nicola es_ES
dc.contributor.author Corberán, Ángel es_ES
dc.contributor.author Plana, Isaac es_ES
dc.contributor.author Reula, Miguel es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2023-09-18T18:01:57Z
dc.date.available 2023-09-18T18:01:57Z
dc.date.issued 2022-08-01 es_ES
dc.identifier.issn 0377-2217 es_ES
dc.identifier.uri http://hdl.handle.net/10251/196713
dc.description.abstract [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, since they can serve them from a distance by traversing arcs that are ¿close enough¿to the customers. We present two formulations of the problem and propose a branch-and-cut and a branch-and- price algorithm based on the respective formulations. A heuristic algorithm used to provide good upper bounds to the exact procedures is also presented. Extensive computational experiments to compare the performance of the algorithms are carried out. es_ES
dc.description.sponsorship The work by Angel Corberan, Isaac Plana, Miguel Reula, and Jose M. Sanchis was supported by the Spanish Ministerio de Ciencia, Innovacion y Universidades (MICIU) and Fondo Social Europeo (FSE) through project PGC2018-099428-B-I00. The authors want to thank the comments and suggestions done by three anonymous reviewers that have contributed to improve the content and readability of the article. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) es_ES
dc.subject Routing es_ES
dc.subject Close-enough arc routing problem es_ES
dc.subject Branch-and-price es_ES
dc.subject Branch-and-cut es_ES
dc.subject Min-max es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title The min-max close-enough arc routing problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2021.10.047 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-099428-B-I00/ES/ANALISIS Y RESOLUCION DE PROBLEMAS DE RUTAS DE VEHICULOS Y LOCALIZACION DE SERVICIOS/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Escuela Técnica Superior de Ingenieros Industriales - Escola Tècnica Superior d'Enginyers Industrials es_ES
dc.description.bibliographicCitation Bianchessi, N.; Corberán, Á.; Plana, I.; Reula, M.; Sanchís Llopis, JM. (2022). The min-max close-enough arc routing problem. European Journal of Operational Research. 300(3):837-851. https://doi.org/10.1016/j.ejor.2021.10.047 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.ejor.2021.10.047 es_ES
dc.description.upvformatpinicio 837 es_ES
dc.description.upvformatpfin 851 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 300 es_ES
dc.description.issue 3 es_ES
dc.relation.pasarela S\461922 es_ES
dc.contributor.funder European Social Fund es_ES
dc.contributor.funder AGENCIA ESTATAL DE INVESTIGACION es_ES


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

Mostrar el registro sencillo del ítem