Back to search

Institutional Repository of Vilnius University

Bikriterinio keliaujančio pirklio uždavinio sprendimas naudojant genetinius algoritmus /

Abstract

dc:description

My thesis is about biobjective Travel Salesman Problem (TSP) which was solved by genetic algorithm. My goal was to analyse the hyperparameters of genetic algorithm and get which values best solve this problem. To make sure if I am getting efficient results I compared my implemented genetic algorithm results with Branch and Bound algorithm which basically solves biobjective TSP and gets optimal Pareto front of 17 cities. During analysis of hyperparameters, I took into account not only the performance of genetic algorithm but also the running time of an algorithm because in reality time is very crucial when you are a courier and need an optimal multi-city route right away. Described and implemented genetic algorithm managed to find the closest results to the optimal solution in a short period of time.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rimgaila, Žygimantas,
Contributors dc:contributor
  • Litvinas, Linas

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

Rimgaila, Žygimantas,. Bikriterinio keliaujančio pirklio uždavinio sprendimas naudojant genetinius algoritmus /. Institutional Repository of Vilnius University, 2021. https://repository.vu.lt/VU:ELABAETD107116771&prefLang=en_US