Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Solving uncapacitated facility location problem using heuristic algorithms
Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2019, izvirni znanstveni članek

Opis: 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.
Ključne besede: Uncapacitated Facility Location Problem (UFLP), Simple Plant Location Problem (SPLP), Warehouse Location Problem (WLP), Heuristics, Randomization
Objavljeno v RUNG: 17.04.2023; Ogledov: 1046; Prenosov: 0
Gradivo ima več datotek! Več...

2.
Deterministic and randomized heuristic algorithms for uncapacitated facility location problem
Soumen Atta, Priya Ranjan Sinha Mahapatra, Anirban Mukhopadhyay, 2018, objavljeni znanstveni prispevek na konferenci

Opis: A well-known combinatorial optimization problem, known as the Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facilities, the objective of UFLP is to open a subset of the potential facilities such that sum of the opening cost for opened facilities and the service cost of customers is minimized. In this paper, deterministic and randomized heuristic algorithms are presented to solve UFLP. The effectivenesses of the proposed algorithms are tested on UFLP instances taken from the OR-Library. Although the proposed deterministic algorithm gives optimal results for most of the instances, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this paper including those for which the deterministic algorithm fails to achieve the optimal solutions.
Ključne besede: Uncapacitated facility location problem (UFLP), Simple plant location problem (SPLP), Warehouse location problem (WLP), Heuristics Randomization
Objavljeno v RUNG: 17.04.2023; Ogledov: 1214; Prenosov: 0
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.01 sek.
Na vrh