Back to search

Institutional Repository of Vilnius University

Rangavimu grįsto algoritmo naujų objektų vietų parinkimui lygiagretinimas /

Abstract

dc:description

This work investigates the tasks of selecting the locations of new objects, mainly emphasizing on reasonable computation time. To solve these types of problems, an algorithm that uses ranking of items of the search area is analyzed. The aim is to create an algorithm which parallel side is as efficient as possible by proposing modifications to the algorithm. These modifications include population of solutions and transferring the logic of search area ranks to the population. The strategies of the two main functions are changed for analyzing the algorithm. The first is the solution generation logic, which is changed between the heuristic solution generation algorithms RDOA and RDOA-D. Second part is the solution evaluation function, which is investigated using the customer selection strategies such as Binary Rule and Partialy Binary Rule. All variants of forementioned strategies are analyzed by comparing the results between sequential and parallel versions with different numbers of processors.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jurčius, Mantas,
Contributors dc:contributor
  • Lančinskas, Algirdas

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

Jurčius, Mantas,. Rangavimu grįsto algoritmo naujų objektų vietų parinkimui lygiagretinimas /. Institutional Repository of Vilnius University, 2021. https://repository.vu.lt/VU:ELABAETD107116152&prefLang=en_US