| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font
First page > Show document

Show document Help

Title:PROBLEM KITAJSKEGA POŠTARJA S PRIORITETNIMI VOZLIŠČI
Authors:ID Kramberger, Tomaž (Author)
ID Žerovnik, Janez (Mentor) More about this mentor... New window
ID Guid, Nikola (Comentor)
Files:.pdf DR_Kramberger_Tomaz_2010.pdf (10,28 MB)
MD5: 4730CECA27EA4A93F42B6B95F068DB8F
PID: 20.500.12556/dkum/a4f563f9-3cb9-42c6-98a7-90299c94ef0b
 
Language:Slovenian
Work type:Dissertation
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V doktorski disertaciji z naslovom Problem kitajskega poštarja s prioritetnimi vozlišči je preučevana posplošitev problema kitajskega poštarja, v kateri je podmnožica vozlišč utežena in vrstni red obiska vozlišč vpliva na vrednost namenske funkcije. Preučevan problem je dokazano NP-težek. V disertaciji sta predstavljeni in preučevani dve konstrukcijski hevristiki. Za eno izmed njih je dokazano, da ob določenih pogojih vrne optimalne rešitve. Hevristiki sta implementirani in testirani na več razredih naključno tvorjenih instanc.
Keywords:problem kitajskega poštarja, problemi usmerjanja, Eulerjev graf, prioritetna vozlišča, modificiran algoritem Dijkstre, modificiran Kruskalov algoritem
Place of publishing:Maribor
Publisher:[T. Kramberger]
Year of publishing:2010
PID:20.500.12556/DKUM-14041 New window
UDC:004.932(043.3)
COBISS.SI-ID:14123542 New window
NUK URN:URN:SI:UM:DK:EXOJMM2A
Publication date in DKUM:27.05.2010
Views:4022
Downloads:459
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
KRAMBERGER, Tomaž, 2010, PROBLEM KITAJSKEGA POŠTARJA S PRIORITETNIMI VOZLIŠČI [online]. Doctoral dissertation. Maribor : T. Kramberger. [Accessed 22 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=14041
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Similar works from other repositories:

No similar works found

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

Secondary language

Language:English
Title:CHINESE POSTMAN PROBLEM WITH PRIORITY NODES
Abstract:A generalization of the Chinese Postman Problem in which the delays at a subset of priority nodes are penalized in the cost function is studied in present thesis. 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, Arc Routing Problem, Eulerian Graph, Priority Nodes, Modified Dijkstra Algorithm, Modified Kruskal Algorithm


Comments

Leave comment

You must log in to leave a comment.

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

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