Repozitorij Univerze v Novi Gorici

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:Solving uncapacitated facility location problem using heuristic algorithms
Avtorji:ID Atta, Soumen, Department of Computer Science and Engineering, JIS University, 81 Nilgunj, Agarpara, Kolkata-700109, West Bengal, India (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani-741235, Nadia, West Bengal, India (Avtor)
ID Mukhopadhyay, Anirban, Department of Computer Science and Engineering, University of Kalyani, Kalyani-741235, Nadia, West Bengal, India (Avtor)
Datoteke: Gradivo nima datotek, ki so prostodostopne za javnost. Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u. Povezava se odpre v novem oknu
Jezik:Angleški jezik
Vrsta gradiva:Delo ni kategorizirano
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:UNG - Univerza v Novi Gorici
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
Leto izida:2019
Št. strani:18-50
Številčenje:2, 8
PID:20.500.12556/RUNG-8145 Novo okno
COBISS.SI-ID:149361155 Novo okno
DOI:10.4018/IJNCR.2019040102 Novo okno
NUK URN:URN:SI:UNG:REP:T7KMEIC1
Datum objave v RUNG:17.04.2023
Število ogledov:1047
Število prenosov:0
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:International Journal of Natural Computing Research
Skrajšan naslov:IJNCR
Založnik:IGI Global
Leto izida:2019
ISSN:1947-928X

Nazaj