| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:UPORABA HIBRIDNIH METAHEVRISTIK PRI REŠEVANJU OPTIMIZACIJSKIH PROBLEMOV
Authors:ID Pesek, Igor (Author)
ID Žerovnik, Janez (Mentor) More about this mentor... New window
ID Brest, Janez (Comentor)
Files:.pdf DR_Pesek_Igor_2009.pdf (1,28 MB)
MD5: 7E568C126AB73D7F75F22E5506995AE0
PID: 20.500.12556/dkum/5f9fd242-5a42-4e26-82c6-1b5e71e792f1
 
Language:Slovenian
Work type:Dissertation
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V doktorski disertaciji sta predstavljena dva algoritma za reševanje težkih kombinatoričnih problemov. Prvi problem se imenuje Problem razvrščanja poslov z omejitvami virov, za katerega smo razvili algoritem z združevanjem konstrukcijske hevristike RAR z algoritmom vzpenjanja na hrib. Drugi problem, ki ga v obravnavamo, je problem načrtovanja usmerjenih omrežij z minimalno ceno in enotnimi vsi-do-vseh komunikacijskimi zahtevami med vozlišči. Za drug algoritem smo razvili algoritem, ki združuje metahevristiko izbiranja s pragom, lokalno iskanje in metodo za obdelavo podatkov. Oba algoritma sta med najboljšimi v primerjalnih testih.
Keywords:hevristični algoritem, lokalno iskanje, metahevristike, optimizacijske metode, NP-težki problemi, razvrščanje poslov z omejitvami virov, načrtovanje usmerjenih omrežij
Place of publishing:Maribor
Publisher:[I. Pesek]
Year of publishing:2009
PID:20.500.12556/DKUM-10077 New window
UDC:004.421.023:519.14(043.3)
COBISS.SI-ID:245245696 New window
NUK URN:URN:SI:UM:DK:OIB8CD2H
Publication date in DKUM:07.04.2009
Views:4507
Downloads:329
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



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:Using hybrid metaheuristics for solving optimization problems
Abstract:In this dissertation we present two algorithms for solving difficult combinatorial problems. First problem is called Resource Constrained Project Scheduling Problem for which we developed an algorithm that combines constructive heuristic RAR with randomized hill climbing algorithm. Second combinatorial problem that we discuss arises in the design of oriented networks with minimal cost in All-to-All communication requests between nodes. Presented algorithm for second problem combines threshold accepting metaheuristics, local search heuristic and post processing method. Presented algorithms are one of the best algorithms in the comparative tests from the literature.
Keywords:heuristic algorithm, local search, metaheuristics, optimization methods, NP-hard problems, resource constrained scheduling problem, oriented network design problem, combinatorial optimization


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