Institutional Repository of Vilnius University
Genetinio algoritmo taikymas optimaliam objektų išdėstymui regione /
Abstract
dc:descriptionGenetic algorithms are applied to solve different optimization problems, one of them being facility location problem. In this paper, the effectiveness of commonly used strategies such as roulette selection, single point crossover or random mutation, for solving the facility location problem is being studied. Furthermore, a review of the literature on various facility location problems and the principles of genetic algorithms is performed. Based on the review, a specific facility location problem for an entering firm is defined. Moreover, the application of the genetic algorithm strategies for the previously defined facility location problem is described. By applying binary and proportional customer behavior models the previously defined task is used for experimental investigation. After experimentally investigating the effectiveness of different selection, crossover and mutation strategies, two algorithms are constructed from the most effective strategies, which are then tested in the same way. An analytical evaluation of the results obtained from the experiments revealed that different strategies perform best with different client behavior models. In addition, algorithms that are using uniform crossover strategy have displayed the best results and algorithms that consist of best performing strategies did not necessarily demonstrate the best results.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Drąsutis, Tomas,
- Contributors dc:contributor
-
- Lančinskas, Algirdas
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD107116302&prefLang=en_US