| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Chinese postman problem with priority nodes
Authors:ID Kramberger, Tomaž (Author)
ID Štrubelj, Gregor (Author)
ID Žerovnik, Janez (Author)
Files:URL http://fcds.cs.put.poznan.pl/FCDS2/ArticleDetails.aspx?articleId=218
Work type:Unknown ()
Typology:1.01 - Original Scientific Article
Organization:FL - Faculty of Logistic
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.
Keywords:Chinese postman problem, ARP, heuristics, Eulerian graph
Year of publishing:2009
PID:20.500.12556/DKUM-30986 New window
ISSN on article:0867-6356
COBISS.SI-ID:512171325 New window
Publication date in DKUM:05.06.2012
Kopiraj citat
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Foundations of Computing and Decision Sciences
Shortened title:Fund. Computing Decis. Sci.
Publisher:Publishing House of Poznan University of Technology
COBISS.SI-ID:1071956 New window


Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
There are no comments!

Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica