| Article ID: | iaor20063382 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 12 |
| Start Page Number: | 3111 |
| End Page Number: | 3128 |
| Publication Date: | Dec 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Corbern Angel, Benavent Enrique, Piana Estefana, Plana Isaac, Sanchis Jos M. |
| Keywords: | heuristics |
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 led 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.