Показати скорочений опис матеріалу
dc.contributor.author | Protsyk, Maksym | |
dc.date.accessioned | 2024-02-14T09:02:46Z | |
dc.date.available | 2024-02-14T09:02:46Z | |
dc.date.issued | 2023 | |
dc.identifier.citation | Protsyk, Maksym. Metaheuristic-based approach to waste collection optimization / Maksym Protsyk; Supervisor: Oleksii Molchanovskyi; Ukrainian Catholic University, Department of Computer Sciences. – Lviv: 2023. – 42 p.: ill. | |
dc.identifier.uri | https://er.ucu.edu.ua/handle/1/4404 | |
dc.language.iso | en | uk |
dc.title | Metaheuristic-based approach to waste collection optimization | uk |
dc.type | Preprint | uk |
dc.status | Публікується вперше | uk |
dc.description.abstracten | The main topic of the thesis is the development of a program that will allow waste companies to reduce their time on route planning by automatizing this task. This work includes the implementation of the framework for experiments and the com- parison of different metaheuristic algorithms (Tabu search, Simulated annealing, Ge- netics algorithms) on synthetic and real data, which was required due to the non- polynomial complexity of the given problem. All the code can be found in my GitHub repository | uk |