20.500.12556/RUNG-8145
Solving uncapacitated facility location problem using heuristic algorithms
A well-known combinatorial optimization problem, known as the uncapacitated facility location problem (UFLP) is considered in this article. A deterministic heuristic algorithm and a randomized heuristic algorithm are presented to solve UFLP. Though the proposed deterministic heuristic algorithm is very simple, it produces good solution for each instance of UFLP considered in this article. The main purpose of this article is to process all the data sets of UFLP available in the literature using a single algorithm. The proposed two algorithms are applied on these test instances of UFLP to determine their effectiveness. Here, the solution obtained from the proposed randomized algorithm is at least as good as the solution produced by the proposed deterministic algorithm. Hence, the proposed deterministic algorithm gives upper bound on the solution produced by the randomized algorithm. Although the proposed deterministic algorithm gives optimal results for most of the instances of UFLP, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this article including those for which the deterministic algorithm fails to achieve the optimal solutions.
Uncapacitated Facility Location Problem (UFLP)
Simple Plant Location Problem (SPLP)
Warehouse Location Problem (WLP)
Heuristics
Randomization
true
true
false
Angleški jezik
Ni določen
Delo ni kategorizirano
2023-04-14 20:39:58
2023-04-17 10:56:37
2023-06-10 03:04:12
0000-00-00 00:00:00
2019
0
0
18-50
8
2
2019
0000-00-00
NiDoloceno
NiDoloceno
NiDoloceno
0000-00-00
0000-00-00
0000-00-00
149361155
10.4018/IJNCR.2019040102
URN:SI:UNG:REP:T7KMEIC1
Univerza v Novi Gorici
0
1
0