| Article ID: | iaor20084741 |
| Country: | Netherlands |
| Volume: | 176 |
| Issue: | 2 |
| Start Page Number: | 855 |
| End Page Number: | 869 |
| Publication Date: | Jan 2007 |
| Journal: | European Journal of Operational Research |
| Authors: | Vigo Daniele, Corbern Angel, Benavent Enrique, Sanchis Jos M., Carrotta Alessandro |
| Keywords: | heuristics, programming: integer |
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very interesting real-life applications. Extensive computational experiments over different sets of instances are also presented.