Soumen Atta (Avtor), Priya Ranjan Sinha Mahapatra (Avtor), Anirban Mukhopadhyay (Avtor)

Povzetek

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;simple plant location problem;warehouse location problem;heuristics;randomization;

Podatki

Jezik: Angleški jezik
Leto izida:
Tipologija: 1.01 - Izvirni znanstveni članek
Organizacija: UNG - Univerza v Novi Gorici
UDK: 004
COBISS: 149361155 Povezava se bo odprla v novem oknu
ISSN: 1947-928X
Št. ogledov: 125
Št. prenosov: 0
Ocena: 0 (0 glasov)
Metapodatki: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Ostali podatki

URN: URN:SI:UNG
Vrsta dela (COBISS): Delo ni kategorizirano
Strani: str. 18-50
Letnik: ǂVol. ǂ8
Zvezek: ǂissue ǂ2
Čas izdaje: 2019
DOI: 10.4018/IJNCR.2019040102
ID: 18625128