- -

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

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

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

Show full item record

Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2017). Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization. 5(3):339-365. https://doi.org/10.1007/s13675-015-0053-8

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

Files in this item

Item Metadata

Title: Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
Author: Ávila, Thais Corberán, Angel Plana, Isaac 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 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 ...[+]
Subjects: Distance constrained , Multivehicle , Generalized directed rural postman problem , Close-enough arc routing problem , Branch-and-cut
Copyrigths: Reserva de todos los derechos
Source:
EURO Journal on Computational Optimization. (issn: 2192-4406 )
DOI: 10.1007/s13675-015-0053-8
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/s13675-015-0053-8
Project ID:
info:eu-repo/grantAgreement/MINECO//MTM2012-36163-C06-02/ES/MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES (OPTIMOS3)/
info:eu-repo/grantAgreement/GVA//PROMETEO%2F2013%2F049/ES/Modelos y algoritmos para problemas de optimización combinatoria/
Thanks:
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.
Type: Artículo

References

Ávila T, Corberán Á, Plana I, Sanchis JM (2015) A new branch-and-cut algorithm for the generalized directed rural postman problem. Transp Sci. doi: 10.1287/trsc.2015.0588

Benavent E, Carrotta A, Corberán Á, Sanchis JM, Vigo D (2007) Lower bounds and heuristics for the windy rural postman problem. Eur J Oper Res 176:855–869

Benavent E, Corberán Á, Plana I, Sanchis JM (2009) Min–max k-vehicles windy rural postman problem. Networks 54:216–226 [+]
Ávila T, Corberán Á, Plana I, Sanchis JM (2015) A new branch-and-cut algorithm for the generalized directed rural postman problem. Transp Sci. doi: 10.1287/trsc.2015.0588

Benavent E, Carrotta A, Corberán Á, Sanchis JM, Vigo D (2007) Lower bounds and heuristics for the windy rural postman problem. Eur J Oper Res 176:855–869

Benavent E, Corberán Á, Plana I, Sanchis JM (2009) Min–max k-vehicles windy rural postman problem. Networks 54:216–226

Corberán Á, Laporte G (eds) (2014) Arc routing: problems, methods, and applications MOS-SIAM series on optimization, Philadelphia

Corberán Á, Plana I, Sanchis JM (2015) 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. J Oper Res Soc 65:1143–1154

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

Gomory RE, Hu TC (1961) Multi-terminal network flows. J Soc Ind Appl Math 9:551–570

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

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: latest advances and new challenges. Springer, Berlin, pp 487–501

[-]

recommendations

 

This item appears in the following Collection(s)

Show full item record