| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:PROBLEM SIMETRIČNEGA TRGOVSKEGA POTNIKA IN OPTIMIZACIJA Z GENETSKIMI ALGORITMI
Authors:ID Juršič, Janko (Author)
ID Brest, Janez (Mentor) More about this mentor... New window
ID Zamuda, Aleš (Comentor)
Files:.pdf UNI_Jursic_Janko_2010.pdf (1014,10 KB)
MD5: CD62309F149AD06A7A1409D13B1E5730
PID: 20.500.12556/dkum/af5ced7e-2687-4812-96c3-29a41d32ce89
 
Language:Slovenian
Work type:Bachelor thesis/paper
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V tem diplomskem delu predstavljamo problem simetričnega trgovskega potnika, različne pristope k reševanju problema ter optimizacijo iskanja rešitve problema z genetskimi algoritmi. Opišemo, kaj problem simetričnega trgovskega potnika predstavlja, kako so ga reševali v preteklosti in kakšne rezultate so dosegli. V diplomskem delu uporabimo naslednje hevristike: metoda najbližjega soseda, genetski algoritem, kombinacijo genetskega algoritma z metodo najbližjega soseda in eksaktni algoritem — metodo sestopanje. Opišemo tudi dobljene rezultate s posamezno hevristiko.
Keywords:simetrični trgovski potnik, genetski algoritem, optimizacija
Place of publishing:Maribor
Publisher:[J. Juršič]
Year of publishing:2010
PID:20.500.12556/DKUM-16295 New window
UDC:004.45:004.8(043.2)
COBISS.SI-ID:14782742 New window
NUK URN:URN:SI:UM:DK:OSFH1UJW
Publication date in DKUM:14.12.2010
Views:3242
Downloads:288
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:SYMMETRIC TRAVELING SALESMAN PROBLEM AND OPTIMIZATION USING GENETIC ALGORITHMS
Abstract:In this diploma work, we introduce traveling salesman problem, different methods for solving the problem, and optimization using genetic algorithms. We introduce the core of the problem, its history, ways to solve it and accomplished results. We also introduce all heuristics we used in this diploma: nearest neighbour heuristic, genetic algorithms, combination of genetic algorithms with nearest neighbour heuristic and exact algorithm – backtracking method. We also introduce results we obtained.
Keywords:symmetric traveling salesman, genetic algorithm, 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