Mostrar el registro sencillo del ítem
dc.contributor.author | Corberán, A. | 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 | 2021-02-05T04:31:31Z | |
dc.date.available | 2021-02-05T04:31:31Z | |
dc.date.issued | 2019-07 | es_ES |
dc.identifier.issn | 1134-5764 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/160765 | |
dc.description.abstract | [EN] The Close-Enough Arc Routing Problem, also called Generalized Directed Rural Postman Problem, is an arc routing problem with 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 within a certain distance of 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, in order to be close enough to each meter. In this paper we deal with an extension of this problem, the Distance-Constrained Generalized Directed Rural Postman Problem or Distance-Constrained Close Enough Arc Routing Problem, in which a fleet of vehicles is available. The vehicles have to leave from and return to a common vertex, the depot, and the length of their routes must not exceed a maximum distance (or time). For solving this problem we propose a matheuristic that incorporates an effective exact procedure to optimize the routes obtained. Extensive computational experiments have been performed on a set of benchmark instances and the results are compared with those obtained with an exact procedure proposed in the literature. | es_ES |
dc.description.sponsorship | This work was supported by the Spanish Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional (FEDER) through Project MTM2015-68097-P (MINECO/FEDER). Authors want to thank two anonymous referees for their suggestions and comments that have contributed to improve the paper. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Springer-Verlag | es_ES |
dc.relation.ispartof | Top | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Close-Enough Arc Routing Problem | es_ES |
dc.subject | Generalized directed Rural Postman Problem | es_ES |
dc.subject | Distance constraints | es_ES |
dc.subject | Matheuristic | es_ES |
dc.subject | Multi-start | es_ES |
dc.subject.classification | MATEMATICA APLICADA | es_ES |
dc.title | A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1007/s11750-019-00507-3 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO//MTM2015-68097-P-P/ES/MODELOS Y ALGORITMOS PARA PROBLEMAS DE RUTAS DE VEHICULOS Y DE LOCALIZACION DE SERVICIOS/ | 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 | Corberán, A.; Plana, I.; Reula, M.; Sanchís Llopis, JM. (2019). A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem. Top. 27(2):312-326. https://doi.org/10.1007/s11750-019-00507-3 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1007/s11750-019-00507-3 | es_ES |
dc.description.upvformatpinicio | 312 | es_ES |
dc.description.upvformatpfin | 326 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 27 | es_ES |
dc.description.issue | 2 | es_ES |
dc.relation.pasarela | S\404241 | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Ministerio de Economía y Competitividad | es_ES |
dc.description.references | Aráoz J, Fernández E, Franquesa C (2017) The generalized arc routing problem. TOP 25:497–525 | es_ES |
dc.description.references | Ávila T, Corberán Á, Plana I, Sanchis JM (2016) A new branch-and-cut algorithm for the generalized directed rural postman problem. Transportation Science 50:750–761 | es_ES |
dc.description.references | Ávila T, Corberán Á, Plana I, Sanchis JM (2017) Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization 5:339–365 | es_ES |
dc.description.references | Cerrone C, Cerulli R, Golden B, Pentangelo R (2017) A flow formulation for the close-enough arc routing problem. In Sforza A. and Sterle C., editors, Optimization and Decision Science: Methodologies and Applications. ODS 2017., volume 217 of Springer Proceedings in Mathematics & Statistics, pages 539–546 | es_ES |
dc.description.references | Corberán Á, Laporte G (editors) (2014) Arc Routing: Problems,Methods, and Applications. MOS-SIAM Series on Optimization,Philadelphia | es_ES |
dc.description.references | Corberán Á, Plana I, Sanchis J.M (2007) Arc routing problems: data instances. http://www.uv.es/~corberan/instancias.htm | es_ES |
dc.description.references | Drexl M (2007) On some generalized routing problems. PhD thesis, Rheinisch-Westfälische Technische Hochschule, Aachen University | es_ES |
dc.description.references | Drexl M (2014) On the generalized directed rural postman problem. Journal of the Operational Research Society 65:1143–1154 | es_ES |
dc.description.references | Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Operations Research 45:568–576 | es_ES |
dc.description.references | Hà M-H, Bostel N, Langevin A, Rousseau L-M (2014) Solving the close enough arc routing problem. Networks 63:107–118 | es_ES |
dc.description.references | Mourão MC, Pinto LS (2017) An updated annotated bibliography on arc routing problems. Networks 70:144–194 | es_ES |
dc.description.references | Renaud A, Absi N, Feillet D (2017) The stochastic close-enough arc routing problem. Networks 69:205–221 | es_ES |
dc.description.references | Shuttleworth R, Golden BL, Smith S, Wasil EA (2008) Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network. In: Golden BL, Raghavan S, Wasil EA (eds) The Vehicle Routing Problem: Lastest Advances and New Challenges. Springer, pp 487–501 | es_ES |