| Abstract [eng] |
The combinatorial optimization problem considered in this paper is facility location problem. Cost-oriented location of one or more than one new facilities out of a set of given locations to meet customer demands. Almost all real-world constraints, demands and guidelines can be considered in these models. In this paper is overview of combinatorial optimization, facility location problems classification and methods used to solve them. There is also presented and realized one exact algorithm – Brute-force, and two heuristics: Greedy and Interchange, and meta-heuristics Simulated Annealing (SA). Analysis of these four algorithms is made. The results showed that Brutal - force is effective solving simple problems. While solving more complicated problems Greedy and Interchange is more effective than Simulated Annealing. |
