New Heuristic Algorithms for the Windy Rural Postman Problem
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postma...
| Autores: | ; ; ; ; |
|---|---|
| Tipo de documento: | Artigo |
| Data de publicação: | 2005 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositório: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | Inglês |
| OAI Identifier: | oai:riunet.upv.es:10251/94488 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/94488 |
| Nível de acesso: | Acesso aberto |
| Palavra-chave: | Heuristics Metaheuristics Arc routing Rural postman problem Windy rural postman problem MATEMATICA APLICADA |
| Resumo: | [EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved. |
|---|