PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Chinese postman problem with priority nodes.
Tomaž Kramberger, Gregor Štrubelj and Janez Žerovnik
Fund. Computing Decis. Sci. Volume 34, Number 4, pp. 233-264, 2009.

Abstract

A generalization of the Chinese Postman Problem is studied in which the delays at a subset of priority nodes are penalized in the cost function. As it is shown that the problem is NP-hard, two tour constructing heuristics are proposed, and their properties are studied. It is proved that one of the heuristics gives optimal solutions on a subset of instances with bounded cost of delays. The implementations of the heuristics are compared on several types of randomly generated instances.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:6363
Deposited By:Igor Pesek
Deposited On:08 March 2010