Problem zapiranja centrov : magistrsko delo

Metličar, Samo (author), Mihelič, Jurij (mentor)

Predmet raziskovanja tega magistrskega dela je problem zapiranja centrov, ki spada med probleme razmeščanja ponudnikov. Predstavljene so osnovne lastnosti ter natančni algoritmi za reševanje problema. Zaradi NP-polnosti so predstavljeni tudi aproksimacijski algoritmi. Empirični testi na različnih omrežjih preverjajo časovno zahtevnost in kakovost rešitev aproksimacijskih algoritmov. Razmerje teh dveh lastnosti je prav tako primerjano. V namen testiranja algoritmov je razvito tudi poštno omrežje Slovenije, cilj katerega je reševanje problema zapiranja poštnih poslovalnic.

• Language: Slovenian
• Keywords: problemi razmeščanja, NP-polnost, aproksimacijski algoritmi, algoritmi na grafih
• Work type: Master's thesis/paper
• Typology: 2.09 - Master's Thesis
• Organization: FMF - Faculty of Mathematics and Physics; FRI - Faculty of Computer and Information Science
• Year: 2022
• PID: 20.500.12556/RUL-138823
• UDC: 004
• COBISS.SI-ID: 118522371
• Publication date in RUL: 20.08.2022

Secondary language

• Language: English
• Title: Center closing problem

Abstract

The main topic of this thesis is the center closing problem, which is a facility location problem. Basic properties and exact algorithms for solving the problem are presented. Because the problem is NP-complete, approximation algorithms are also presented. Time complexity, the quality of results, and the ratio between the two are tested for approximation algorithms using empirical tests. For the purpose of testing the algorithms a postal network of Slovenia was constructed, the goal of which was to solve the post office closing problem.

• Keywords: facility location, NP-completeness, approximation algorithms, graph algorithms