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

Povzetek

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.

Ključne besede

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

Podatki

Jezik: Angleški jezik
Leto izida:
Tipologija: 1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija: UM FS - Fakulteta za strojništvo
UDK: 519.8
COBISS: 14785369 Povezava se bo odprla v novem oknu
Matična publikacija: KOI 2006
Št. ogledov: 0
Št. prenosov: 0
Ocena: 0 (0 glasov)
Metapodatki: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Ostali podatki

Sekundarni jezik: Angleški jezik
Sekundarne ključne besede: kombinatorična optimizacija;diskretna optimizacija;
URN: URN:SI:UM:
Vrsta dela (COBISS): Delo ni kategorizirano
Strani: Str. 25-33
ID: 8720615