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

Podatki

Jezik: Angleški jezik
Leto izida:
Tipologija: 1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija: UNG - Univerza v Novi Gorici
UDK: 004
COBISS: 149339907 Povezava se bo odprla v novem oknu
Št. ogledov: 131
Š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. 205-216
DOI: 10.1007/978-981-10-7563-6_22
ID: 18625134