Institutional Repository of Vilnius University
Optimalių vietų parinkimo uždaviniai ir jų sprendimai /
Abstract
dc:descriptionThe main objective of the thesis is to develop a code repository that implements search algorithms and customer behavior models to solve the variations of Competitive Facility Location problems. In this work, 4 customer behavior models are considered to predict how many customers will choose to visit new facilities: binary, proportional, partial proportional and Pareto Huff models. 3 search algorithms, that use these models as objective functions for the entering firm and firm expansion problem variations, were also analyzed: brute force, pure random search and ranking based search. Pure random search and ranking based search algorithms were compared by their average found market values throughout different search cycles as well as by the difference in their computation time when calculating the solutions of different variants of the problem.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Žitkevičius, Benas,
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:ELABAETD192843414&prefLang=en_US