Min-Max K-vehicles Windy Rural Postman Problem
[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 st...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/150418 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/150418 |
| Access Level: | acceso abierto |
| Palabra clave: | Rural postman problem Windy postman problem Windy rural postman problem Facets Multivehicles MATEMATICA APLICADA |
| Sumario: | [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 |
|---|