New heuristic algorithms for the windy rural postman problem |
| |
| Authors: | Enrique Benavent, Angel Corber n, Estefaní a Pi ana, Isaac Plana,Jos M. Sanchis |
| |
| Affiliation: | aDepartmento d’Estadística i Investigació Operativa, Universitat de València, Dr. Moliner 50, Burjassot, Valencia 46100, Spain;bDepartmento de Matemática Aplicada, Universidad Politécnica de Valencia, Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | Heuristics Metaheuristics Arc routing Rural postman problem Windy rural postman problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
