Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

[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 a series of neighborhoods. If the vehicle gets closer than a certain distance...

Descripción completa

Detalles Bibliográficos
Autores: Ávila, Thais, Corberán, Angel, Plana, Isaac, Sanchís Llopis, José María|||0000-0002-0039-8122
Tipo de recurso: artículo
Fecha de publicación:2017
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/107412
Acceso en línea:https://riunet.upv.es/handle/10251/107412
Access Level:acceso abierto
Palabra clave:Distance constrained
Multivehicle
Generalized directed rural postman problem
Close-enough arc routing problem
Branch-and-cut
MATEMATICA APLICADA
id ES_3afdb14c3d92cb763d18929c39326fe2
oai_identifier_str oai:riunet.upv.es:10251/107412
network_acronym_str ES
network_name_str España
repository_id_str
spelling Formulations and exact algorithms for the distance-constrained generalized directed rural postman problemÁvila, ThaisCorberán, AngelPlana, IsaacSanchís Llopis, José María|||0000-0002-0039-8122Distance constrainedMultivehicleGeneralized directed rural postman problemClose-enough arc routing problemBranch-and-cutMATEMATICA APLICADA[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 a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distance (or time) constraint all of them have to satisfy.We introduce four formulations for this problem, propose some families of valid inequalities, and present four branch-and-cut algorithms for its solution. The formulations and the algorithms are compared on a large set of instances.The authors thank the Spanish Ministerio de Economia y Competitividad (project MTM2012-36163-C06-02) and the Generalitat Valenciana (project GVPROMETEO2013-049) for their support.Springer-VerlagDepartamento de Matemática AplicadaInstituto Universitario de Matemática Pura y AplicadaEscuela Técnica Superior de Ingeniería IndustrialMinisterio de Economía y CompetitividadGeneralitat ValencianaRepositorio Institucional de la Universitat Politècnica de València Riunet20172017-01-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/107412reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 MTM2012-36163-C06-02 MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2013%2F049 Modelos y algoritmos para problemas de optimización combinatoriaopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/1074122026-06-13T07:49:27Z
dc.title.none.fl_str_mv Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
title Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
spellingShingle Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
Ávila, Thais
Distance constrained
Multivehicle
Generalized directed rural postman problem
Close-enough arc routing problem
Branch-and-cut
MATEMATICA APLICADA
title_short Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
title_full Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
title_fullStr Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
title_full_unstemmed Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
title_sort Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
dc.creator.none.fl_str_mv Ávila, Thais
Corberán, Angel
Plana, Isaac
Sanchís Llopis, José María|||0000-0002-0039-8122
author Ávila, Thais
author_facet Ávila, Thais
Corberán, Angel
Plana, Isaac
Sanchís Llopis, José María|||0000-0002-0039-8122
author_role author
author2 Corberán, Angel
Plana, Isaac
Sanchís Llopis, José María|||0000-0002-0039-8122
author2_role author
author
author
dc.contributor.none.fl_str_mv Departamento de Matemática Aplicada
Instituto Universitario de Matemática Pura y Aplicada
Escuela Técnica Superior de Ingeniería Industrial
Ministerio de Economía y Competitividad
Generalitat Valenciana
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Distance constrained
Multivehicle
Generalized directed rural postman problem
Close-enough arc routing problem
Branch-and-cut
MATEMATICA APLICADA
topic Distance constrained
Multivehicle
Generalized directed rural postman problem
Close-enough arc routing problem
Branch-and-cut
MATEMATICA APLICADA
description [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 a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distance (or time) constraint all of them have to satisfy.We introduce four formulations for this problem, propose some families of valid inequalities, and present four branch-and-cut algorithms for its solution. The formulations and the algorithms are compared on a large set of instances.
publishDate 2017
dc.date.none.fl_str_mv 2017
2017-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/107412
url https://riunet.upv.es/handle/10251/107412
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 MTM2012-36163-C06-02 MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)
Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEO%2F2013%2F049 Modelos y algoritmos para problemas de optimización combinatoria
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer-Verlag
publisher.none.fl_str_mv Springer-Verlag
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406277300387840
score 15.300724

Similares en LA Referencia