- -

A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

Show full item record

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

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/160765

Files in this item

Item Metadata

Title: A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Author: Corberán, A. PLANA, ISAAC Reula, Miguel Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
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, ...[+]
Subjects: Close-Enough Arc Routing Problem , Generalized directed Rural Postman Problem , Distance constraints , Matheuristic , Multi-start
Copyrigths: Reserva de todos los derechos
Source:
Top. (issn: 1134-5764 )
DOI: 10.1007/s11750-019-00507-3
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/s11750-019-00507-3
Project ID:
info:eu-repo/grantAgreement/MINECO//MTM2015-68097-P-P/ES/MODELOS Y ALGORITMOS PARA PROBLEMAS DE RUTAS DE VEHICULOS Y DE LOCALIZACION DE SERVICIOS/
Thanks:
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 ...[+]
Type: Artículo

References

Aráoz J, Fernández E, Franquesa C (2017) The generalized arc routing problem. TOP 25:497–525

Á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

Á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 [+]
Aráoz J, Fernández E, Franquesa C (2017) The generalized arc routing problem. TOP 25:497–525

Á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

Á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

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

Corberán Á, Laporte G (editors) (2014) Arc Routing: Problems,Methods, and Applications. MOS-SIAM Series on Optimization,Philadelphia

Corberán Á, Plana I, Sanchis J.M (2007) Arc routing problems: data instances. http://www.uv.es/~corberan/instancias.htm

Drexl M (2007) On some generalized routing problems. PhD thesis, Rheinisch-Westfälische Technische Hochschule, Aachen University

Drexl M (2014) On the generalized directed rural postman problem. Journal of the Operational Research Society 65:1143–1154

Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Operations Research 45:568–576

Hà M-H, Bostel N, Langevin A, Rousseau L-M (2014) Solving the close enough arc routing problem. Networks 63:107–118

Mourão MC, Pinto LS (2017) An updated annotated bibliography on arc routing problems. Networks 70:144–194

Renaud A, Absi N, Feillet D (2017) The stochastic close-enough arc routing problem. Networks 69:205–221

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

[-]

recommendations

 

This item appears in the following Collection(s)

Show full item record