Lower bounds and heuristics for the Windy Rural Postman Problem

In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of 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.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo
• Keywords: EOR 2007, Heuristic Algorithms, Important Arc, Rural Postman Problem