Article ID: | iaor20052307 |
Country: | Netherlands |
Volume: | 26 |
Issue: | 1 |
Start Page Number: | 27 |
End Page Number: | 32 |
Publication Date: | Feb 2000 |
Journal: | Operations Research Letters |
Authors: | Improta Gennaro, Ghiani Gianpaolo |
Keywords: | heuristics |
The Hierarchical Chinese Postman Problem (HCPP) is a variant of the classical Chinese Postman Problem, in which the arcs are partitioned into clusters and a precedence relation is defined on clusters. Practical applications of the HCPP include snow and ice control on the roads and determination of optimal torch paths in flame cutting. The HCPP is NP-hard in general, but polynomial-time solvable if the precedence relation is linear and each cluster is connected. For this case an exact algorithm, requiring a lower computational effort than previous procedures, is described.