| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Reševanje problema trgovskega potnika s paralelnim simuliranim ohlajanjem
Authors:ID Strašek, Matej (Author)
ID Brest, Janez (Mentor) More about this mentor... New window
ID Zamuda, Aleš (Comentor)
Files:.pdf UNI_Strasek_Matej_2014.pdf (886,78 KB)
MD5: 2E698E4F3A905169AF55802573F84F03
 
Language:Slovenian
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu skušamo s paralelizacijo algoritma simuliranega ohlajanja izboljšati čas reševanja problema trgovskega potnika. S pomočjo vmesnika OpenMP implementiramo paralelizacije algoritmov sosednosti k-opt, simulirano ohlajanje in izboljšavo le-tega – sprejemljivo simulirano ohlajanje. Predstavimo algoritme in zberemo njihove rezultate za paralelizacijo zanke, paralelizacijo particij, paralelizacijo z različnim razponom in prilagodljivo paralelizacijo simuliranega ohlajanja. Prvi del predstavlja opis problema trgovskega potnika, vmesnika OpenMP, opis implementiranih algoritmov in njihovih paralelizacij. V zadnjem delu so predstavljeni rezultati na problemih trgovskega potnika iz knjižnice TSPLIB, njihova medsebojna primerjava ter možnosti za nadaljnje raziskave.
Keywords:problem trgovskega potnika, simulirano ohlajanje, paralelizacija simuliranega ohlajanja
Place of publishing:[Maribor
Publisher:M. Strašek
Year of publishing:2014
PID:20.500.12556/DKUM-45202 New window
UDC:004.41.021:519.8(043.2)
COBISS.SI-ID:19113238 New window
NUK URN:URN:SI:UM:DK:VXKTAMD5
Publication date in DKUM:06.11.2015
Views:2786
Downloads:130
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
STRAŠEK, Matej, 2014, Reševanje problema trgovskega potnika s paralelnim simuliranim ohlajanjem [online]. Bachelor’s thesis. Maribor : M. Strašek. [Accessed 17 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=45202
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


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:Solving travelling salesman problem with parallel simulated annealing
Abstract:The diploma thesis focuses on improving the solving time for the travelling salesman problem, by parallelizing the simulated annealing algorithm. We implement parallelization of local k-opt algorithms, simulated annealing, and an improvement of this - the acceptance simulated annealing, by using OpenMP interface. We present algorithms and gather their results using the parallelization of the loops, parallelization of the partitions, parallelization with different range, and adaptable parallelization of simulated annealing. The first part covers the presentation of the travelling salesman problem, the OpenMP interface, and the description of the implemented algorithms and their parallelization. The last part features the results based on the travelling salesman problems from the TSPLIB library, their mutual comparison, and the possibilities for further research.
Keywords:traveling salesman problem, simulated annealing, simulated annealing parallelization


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