Chinese postman problem with priorities (high cost of delays)

| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Prva stran > Izpis gradiva

Izpis gradiva

Naslov:	Chinese postman problem with priorities (high cost of delays)
Avtorji:	ID Kramberger, Tomaž (Avtor) ID Žerovnik, Janez (Avtor)
Datoteke:	http://oliver.efpu.hr/koi06/koi06_proceedings.pdf
Jezik:	Angleški jezik
Vrsta gradiva:	Neznano
Tipologija:	1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:	FL - Fakulteta za logistiko
Opis:	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:	combinatorial optimization, discrete optimization
Leto izida:	2008
PID:	20.500.12556/DKUM-30929
UDK:	519.8
COBISS.SI-ID:	14785369
NUK URN:	URN:SI:UM:DK:9BGX4AWK
Datum objave v DKUM:	05.06.2012
Število ogledov:	1822
Število prenosov:	62
Metapodatki:
Področja:	Ostalo
:	Kopiraj citat

Skupna ocena:	(0 glasov)
Vaša ocena:	Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:

Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Jezik:	Angleški jezik
Ključne besede:	kombinatorična optimizacija, diskretna optimizacija

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)

0 - 0 / 0

Ni komentarjev!

Nazaj