- -

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 sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: Benavent;Corberan ...
Tamaño: 286.2Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: NETWORKS2009_MMKW ...
Tamaño: 173.2Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Benavent López, Enrique es_ES
dc.contributor.author Corberan, Angel es_ES
dc.contributor.author Plana, Isaac es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2020-09-19T03:33:15Z
dc.date.available 2020-09-19T03:33:15Z
dc.date.issued 2009-12 es_ES
dc.identifier.issn 0028-3045 es_ES
dc.identifier.uri http://hdl.handle.net/10251/150418
dc.description.abstract [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 of balanced tours for the vehicles, we present here an ILP formulation and study its associated polyhedron. Based on its partial description, a branch-and-cut algorithm has been implemented and computational results on a large set of instances are finally presented. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(4),216-226 2009 es_ES
dc.description.sponsorship Contract grant sponsor: Ministerio de Education y Ciencia of Spain: Contract gram number: MTM2006-14961-C05-02 es_ES
dc.language Inglés es_ES
dc.publisher John Wiley & Sons es_ES
dc.relation.ispartof Networks es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Rural postman problem es_ES
dc.subject Windy postman problem es_ES
dc.subject Windy rural postman problem es_ES
dc.subject Facets es_ES
dc.subject Multivehicles es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title Min-Max K-vehicles Windy Rural Postman Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1002/net.20334 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MEC//MTM2006-14961-C05-02/ES/OPTIMOS: OPTIMIZACION PARA LA MOVILIDAD SOSTENIBLE/ 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 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 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1002/net.20334 es_ES
dc.description.upvformatpinicio 216 es_ES
dc.description.upvformatpfin 226 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 54 es_ES
dc.description.issue 4 es_ES
dc.relation.pasarela S\37746 es_ES
dc.contributor.funder Ministerio de Educación y Ciencia es_ES
dc.description.references D. Ahr Contributions to multiple postmen problems 2004 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references D. Applegate R.E. Bixby V. Chvátal W. Cook Finding cuts in the TSP 1995 es_ES
dc.description.references 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 es_ES
dc.description.references Belenguer, J. M., & Benavent, E. (1998). Computational Optimization and Applications, 10(2), 165-187. doi:10.1023/a:1018316919294 es_ES
dc.description.references 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 es_ES
dc.description.references N. Christofides V. Campos A. Corberán E. Mota An algorithm for the rural postman problem 1981 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references G. Ghiani D. Laganá G. Laporte R. Musmanno A branch-and-cut algorithm for the undirected capacitated arc routing problem 2007 es_ES
dc.description.references 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 es_ES
dc.description.references Golden, B. L., & Wong, R. T. (1981). Capacitated arc routing problems. Networks, 11(3), 305-315. doi:10.1002/net.3230110308 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES


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

Mostrar el registro sencillo del ítem