- -

Min-Max K-vehicles Windy Rural Postman Problem

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Min-Max K-vehicles Windy Rural Postman Problem

Mostrar el registro completo del ítem

Benavent López, E.; Corberan, A.; Plana, I.; Sanchís Llopis, JM. (2009). Min-Max K-vehicles Windy Rural Postman Problem. Networks. 54(4):216-226. https://doi.org/10.1002/net.20334

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

Ficheros en el ítem

Thumbnail
Nombre: Benavent;Corberan ...
Tamaño: 286.2Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir/Preview
[Cerrado]
Nombre: NETWORKS2009_MMKW ...
Tamaño: 173.2Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: Min-Max K-vehicles Windy Rural Postman Problem
Autor: Benavent López, Enrique Corberan, Angel Plana, Isaac Sanchís Llopis, José María
Entidad UPV: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Fecha difusión:
Resumen:
[EN] In this article the Min-Max version of the windy rural postman problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set ...[+]
Palabras clave: Rural postman problem , Windy postman problem , Windy rural postman problem , Facets , Multivehicles
Derechos de uso: Reserva de todos los derechos
Fuente:
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.20334
Editorial:
John Wiley & Sons
Versión del editor: https://doi.org/10.1002/net.20334
Código del Proyecto:
info:eu-repo/grantAgreement/MEC//MTM2006-14961-C05-02/ES/OPTIMOS: OPTIMIZACION PARA LA MOVILIDAD SOSTENIBLE/
Agradecimientos:
Contract grant sponsor: Ministerio de Education y Ciencia of Spain: Contract gram number: MTM2006-14961-C05-02
Tipo: Artículo

References

D. Ahr Contributions to multiple postmen problems 2004

D. Ahr G. Reinelt “New heuristics and lower bounds for the min-max k -Chinese postman problem” Algorithms-ESA 2002, 10th Annual European Symposium, Rome, Italy, 2002, Lecture Notes in Computer Science 2461 R. Möring R. Raman Springer Berlin 2002 64 74

Ahr, D., & Reinelt, G. (2006). A tabu search algorithm for the min–max k-Chinese postman problem. Computers & Operations Research, 33(12), 3403-3422. doi:10.1016/j.cor.2005.02.011 [+]
D. Ahr Contributions to multiple postmen problems 2004

D. Ahr G. Reinelt “New heuristics and lower bounds for the min-max k -Chinese postman problem” Algorithms-ESA 2002, 10th Annual European Symposium, Rome, Italy, 2002, Lecture Notes in Computer Science 2461 R. Möring R. Raman Springer Berlin 2002 64 74

Ahr, D., & Reinelt, G. (2006). A tabu search algorithm for the min–max k-Chinese postman problem. Computers & Operations Research, 33(12), 3403-3422. doi:10.1016/j.cor.2005.02.011

D. Applegate R.E. Bixby V. Chvátal W. Cook Finding cuts in the TSP 1995

Barahona, F., & Grötschel, M. (1986). On the cycle polytope of a binary matroid. Journal of Combinatorial Theory, Series B, 40(1), 40-62. doi:10.1016/0095-8956(86)90063-8

Belenguer, J. M., & Benavent, E. (1998). Computational Optimization and Applications, 10(2), 165-187. doi:10.1023/a:1018316919294

Benavent, E., Carrotta, A., Corberán, A., Sanchis, J. M., & Vigo, D. (2007). Lower bounds and heuristics for the Windy Rural Postman Problem. European Journal of Operational Research, 176(2), 855-869. doi:10.1016/j.ejor.2005.09.021

N. Christofides V. Campos A. Corberán E. Mota An algorithm for the rural postman problem 1981

Christofides, N., Campos, V., Corberán, A., & Mota, E. (1986). An algorithm for the Rural Postman problem on a directed graph. Netflow at Pisa, 155-166. doi:10.1007/bfb0121091

Corberán, A., Plana, I., & Sanchis, J. M. (2008). The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. SIAM Journal on Discrete Mathematics, 22(2), 606-628. doi:10.1137/050640886

Corberán, A., Plana, I., & Sanchis, J. M. (2007). A branch & cut algorithm for the windy general routing problem and special cases. Networks, 49(4), 245-257. doi:10.1002/net.20176

Eiselt, H. A., Gendreau, M., & Laporte, G. (1995). Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research, 43(3), 399-414. doi:10.1287/opre.43.3.399

Frederickson, G. N., Hecht, M. S., & Kim, C. E. (1978). Approximation Algorithms for Some Routing Problems. SIAM Journal on Computing, 7(2), 178-193. doi:10.1137/0207017

G. Ghiani D. Laganá G. Laporte R. Musmanno A branch-and-cut algorithm for the undirected capacitated arc routing problem 2007

Ghiani, G., & Laporte, G. (2000). A branch-and-cut algorithm for the Undirected Rural Postman Problem. Mathematical Programming, 87(3), 467-481. doi:10.1007/s101070050007

Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11(3), 305-315. doi:10.1002/net.3230110308

Padberg, M. W., & Rao, M. R. (1982). Odd Minimum Cut-Sets andb-Matchings. Mathematics of Operations Research, 7(1), 67-80. doi:10.1287/moor.7.1.67

Pearn, W. L. (1994). Solvable cases of the k-person Chinese postman problem. Operations Research Letters, 16(4), 241-244. doi:10.1016/0167-6377(94)90073-6

[-]

recommendations

 

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

Mostrar el registro completo del ítem