Lower bounds and heuristics for the Windy Rural Postman Problem |
| |
| Authors: | Enrique Benavent,Alessandro Carrotta,Angel Corberá n,José M. Sanchis,Daniele Vigo |
| |
| Affiliation: | 1. Departamento de Estadistica e I.O., Facultad de Matematicas, Universitat de València, Avda. Dr. Moliner 50, 46100 Burjasot, Spain;2. D.E.I.S., University of Bologna, 40136 Bologna, Italy;3. D.M.A., Universidad Politécnica de Valencia, 46022 Valencia, Spain |
| |
| Abstract: | ![]()
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. |
| |
| Keywords: | Routing Heuristics Windy Rural Postman Problem Cutting planes |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
