Chinese postman problem with priorities (high cost of delays)

Tomaž Kramberger (Author), Janez Žerovnik (Author)

Abstract

Several real-world problems, such as street sweeping, mail delivery, solid waste collection, salt gritting and snow plowing can be modeled as Chinese postman problems with some additional constraints. In the paper we present a formal definition of the special case of CPP problem where a subset of priority nodes are given that must be visited as soon as possible, i.e. the cost of delays is much bigger than the cost of additional edges traversed. A heuristical algorithm is proposed which gives near optimal feasible solutions.

Keywords

kombinatorična optimizacija;diskretna optimizacija;combinatorial optimization;discrete optimization;

Data

Language:	English
Year of publishing:	2008
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	UM FS - Faculty of Mechanical Engineering
UDC:	519.8
COBISS:	14785369
Parent publication:	KOI 2006
Views:	0
Downloads:	0
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary keywords:	kombinatorična optimizacija;diskretna optimizacija;
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	Str. 25-33
ID:	8720615