| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Reševanje problema nesimetričnega trgovskega potnika z diferencialno evolucijo in hevrističnimi algoritmi
Authors:ID Brest, Štefan (Author)
ID Žumer, Viljem (Mentor) More about this mentor... New window
Files:.pdf UNI_Brest_stefan_2009.pdf (2,77 MB)
MD5: 0F9B6CF0F471F962E0ECC9410F93F136
PID: 20.500.12556/dkum/acef3f30-d46a-4923-8a5e-935fd27c9128
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu podamo zgodovino in razvoj evolucijskih algoritmov ter diferencialne evolucije. Opišemo tudi hevristične algoritme, ki bodo osnova za reševanje problema nesimetričnega trgovskega potnika. Osrednji del diplomskega dela predstavlja načrtovanje in implementacija algoritmov DEATSP, kjer poiskušamo rešiti problem nesimetričnega trgovskega potnika z diferencialno evolucijo. Ti vključujejo različne kombinacije hevrističnih algoritmov, kjer skušamo ugotoviti, katera od teh
Keywords:problem trgovskega potnika, diferencialna evolucija, hevristični algoritmi, optimizacija, iskanje globalnega optimuma
Place of publishing:Maribor
Publisher:[Š. Brest]
Year of publishing:2009
PID:20.500.12556/DKUM-9624 New window
UDC:004.021:004.89(043.2)
COBISS.SI-ID:12996374 New window
NUK URN:URN:SI:UM:DK:HSDVNARS
Publication date in DKUM:02.02.2012
Views:3563
Downloads:215
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:Solving Asymmetric Traveling Salesman Problem with Differential Evolution and Heuristic Algorithms
Abstract:The presented diploma work begins with the history and development of evolutionary algorithms and differential evolution. Heuristic algorithms are described as basis for the asymmetric traveling salesman problem solving. The main part of the diploma work is designing and implementation of DEATSP algorithms, where we try to solve asymmetric salesman problem with differential evolution. These involve various combinations of heuristic algorithms and our aim is to search for the one that gives the best solut
Keywords:traveling salesman problem, differential evolution, heuristic algorithms, optimization, searching global optimum


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