Repozitorij Univerze v Novi Gorici

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

Naslov:Population-based improvement heuristic with local search for single-row facility layout problem
Avtorji:ID Atta, Soumen, Indian Institute of Information Technology (IIIT) Vadodara, Gandhinagar Campus, Sector 28, Gandhinagar, Gujarat 382028, India (Avtor)
ID Sinha Mahapatra, Priya Ranjan, Department of Computer Science and Engineering, University of Kalyani, Kalyani, 741235, 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:The Single-Row Facility Layout Problem (SRFLP) is a well-known combinatorial optimization problem. The objective of SRFLP is to find out the arrangement of facilities with given lengths on a line so that the weighted sum of the distances between all pairs of facilities is minimized. This problem is known to be NP-hard. Hence, a population-based improvement heuristic algorithm with local search is presented in this article to solve SRFLP. The proposed algorithm works well also for the Single-Row Equidistant Facility Layout Problem (SREFLP), where the length of each facility is equal. The computational efficiency of the proposed algorithm is checked with the instances of sizes ranging from 5 to 300 available in the literature for SRFLP and SREFLP. The obtained results are compared to those from different state-of-the-art algorithms. The proposed algorithm achieves best known solutions to date for every instance considered in this article in reasonable computational time.
Ključne besede:Single-row facility layout problem (SRFLP), single-row equidistant facility layout problem (SREFLP), population-based heuristic, improvement heuristic, local search
Leto izida:2019
Št. strani:1-19
Številčenje:222, 44
PID:20.500.12556/RUNG-8143 Novo okno
COBISS.SI-ID:149352451 Novo okno
DOI:https://doi.org/10.1007/s12046-019-1203-0 Novo okno
NUK URN:URN:SI:UNG:REP:MF2RDIQD
Datum objave v RUNG:17.04.2023
Število ogledov:807
Š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:Sādhanā
Skrajšan naslov:Sādhanā
Založnik:Springer
Leto izida:2019
ISSN:0973-7677

Nazaj