Back to search

Institutional Repository of Vilnius University

Evoliuciniai algoritmai. Skruzdžių kolonijų optimizavimo algoritmas /

Abstract

dc:description

This study explores evolutionary optimization algorithms, which are mathematical and computational methods that mimic natural evolution processes to solve complex optimization problems. A detailed analysis of the Ant Colony Optimization (ACO) algorithm and its application in various optimization tasks is presented. For instance, the Traveling Salesman Problem, which requires finding the shortest route through all cities, demonstrates the flexibility and efficiency of the ACO algorithm in logistics. The problem of finding the maximum of a function shows ACO's ability to adapt to varying complexities of functions, while the knapsack problem reveals the algorithm's capability to optimize item arrangement in a limited space. Additionally, the task of DNA sequence alignment highlights the significance of the ACO algorithm in biology, where it aids in accurately aligning genetic sequences, uncovering evolutionary relationships and genetic variations. These studies illustrate how the ACO algorithm can be successfully applied to solve real-world optimization problems.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Žitkutė, Gabrielė,

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

Žitkutė, Gabrielė,. Evoliuciniai algoritmai. Skruzdžių kolonijų optimizavimo algoritmas /. Institutional Repository of Vilnius University, 2024. https://repository.vu.lt/VU:ELABAETD210648424&prefLang=en_US