An algorithm for the hierarchical Chinese postman problem

Authors:
Gianpaolo Ghiani;Gennaro Improta
Affiliations:
Dipartimento di Informatica e Sistemistica, Universití "Federico II", Via Claudio 21, 80125 Napoli, Italy and GERAD, ícole des Hautes ítudes Commerciales, 3000, Chemin de la Cô ...;Dipartimento di Informatica e Sistemistica, Universití "Federico II", Via Claudio 21, 80125 Napoli, Italy
Venue:
Operations Research Letters
Year:
2000

Citing 0
Cited 2

A tabu scatter search metaheuristic for the arc routing problem

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Approximate solutions for the maximum benefit Chinese postman problem

International Journal of Systems Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.