Back to search

Institutional Repository of Vilnius University

Euristiniai algoritmai keliaujančio pirklio maršruto tobulinimui /

Abstract

dc:description

The goal of this bachelor’s thesis was to provide recommendations about usage of heuristic tour improving traveling salesman problem algorithms. So, three popular tour improving traveling salesman algorithms: “2 - opt”, “Simulated Annealing” and “taboo” were analyzed and compared. Also, the environments, used for those algorithms analysis and test data generation, were created. Detailed descriptions about done experiments and used data is provided in this work. Finally, algorithms usage recommendations, based on experiments results and conclusions, are provided.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Aleknavičius, Lukas,
Contributors dc:contributor
  • Radavičius, Irmantas

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

Aleknavičius, Lukas,. Euristiniai algoritmai keliaujančio pirklio maršruto tobulinimui /. Institutional Repository of Vilnius University, 2020. https://repository.vu.lt/VU:ELABAETD81806137&prefLang=en_US