Back to search

Institutional Repository of Vilnius University

Genetinio algoritmo lyginimas su kitais euristiniais optimizavimo metodais keliaujančio pirklio uždaviniui spręsti /

Abstract

dc:description

This paper discussed the literature analysis of genetic algorithm, ant colony algorithm and simulated annealing. Also, the parameters of the heuristic algorithms and their application to solve the traveling salesman problem data sets of different sizes were investigated. The main objective of this work is to compare the genetic algorithm with other heuristic optimization methods in terms of solution optimality and solution acquisition time. From the obtained results, it can be seen that genetic algorithm outperforms ant colony algorithm. When solving small to medium data sets, the genetic algorithm can demonstrate similar results to the simulated annealing but as the data sets increase, the genetic algorithm is inferior to the simulated annealing method.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Žukauskas, Tomas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Žukauskas, Tomas,. Genetinio algoritmo lyginimas su kitais euristiniais optimizavimo metodais keliaujančio pirklio uždaviniui spręsti /. Institutional Repository of Vilnius University, 2024. https://repository.vu.lt/VU:ELABAETD210647080&prefLang=en_US