Back to search

Institutional Repository of Vilnius University

Optimal selection of operators in genetic algorithm for tsp /

Abstract

dc:description

The Travelling Salesman Problem aims to discover Hamiltonian cycle route through the cities positioned on a two-dimensional space. This optimization problem presents a traditional challenge for which different solution methods apply. The article examines the genetic solution method based on natural selection principles. The crossover operator determines how offspring solutions (new solutions) are created through the combination of existing solutions in the process of generating new offspring. The goal of this analysis is to determine if using multiple operators in conjunction can yield superior results.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Meinorius, Arentas,

Subjects

dc:subject × 1

Rights

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

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
citation

Meinorius, Arentas,. Optimal selection of operators in genetic algorithm for tsp /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD239031714&prefLang=en_US