A hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problem

Basit Öğe Kaydı
dc.authoridGolcuk, Ilker/0000-0002-8430-7952
dc.authorwosidGolcuk, Ilker/B-2116-2015
dc.contributor.authorÖzsoydan, Fehmi Burçin
dc.contributor.authorGölcük, İlker
dc.date.accessioned2023-03-22T19:47:19Z
dc.date.available2023-03-22T19:47:19Z
dc.date.issued2022
dc.departmentBelirleneceken_US
dc.description.abstractThis paper introduces a cooperative approach of a swarm intelligence algorithm and a linear programming solver to solve the capacitated facility location problem (CFLP). Given a set of potential locations to open facilities, the aim in CFLP is to find the minimum cost, which is the sum of facility opening costs and transportation costs. The developed solution strategy decomposes CFLP into two sub-problems. The former sub-problem has a binary domain. Although most of the swarm intelligence algorithms employ additional procedures such as sigmoid function to deal with binary domains, the proposed algorithm does not require for such methods. An adaptive mutation operator enhances this algorithm. The aim of the latter sub-problem is to generate a policy that optimally assigns customers to the opened facilities. In this regard, the generated binary vectors by the proposed algorithm are passed to a solver to optimise the generated linear model. Commonly used instances available in the literature are solved by the proposed strategy. Comprehensive experimental study includes comparisons with the sate-of-the-art. According to the statistically verified results, the proposed strategy is found as promising in solving CFLP.en_US
dc.identifier.doi10.1080/00207543.2022.2079438
dc.identifier.issn0020-7543
dc.identifier.issn1366-588X
dc.identifier.scopus2-s2.0-85131383332en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1080/00207543.2022.2079438
dc.identifier.urihttps://hdl.handle.net/20.500.14034/615
dc.identifier.wosWOS:000804609900001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.journalInternational Journal Of Production Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCapacitated facility location problemen_US
dc.subjectevolutionary algorithmsen_US
dc.subjectswarm intelligenceen_US
dc.subjectgenetic algorithmen_US
dc.subjectparticle swarm optimisationen_US
dc.subjectLagrangean Relaxationen_US
dc.subjectSearchen_US
dc.subjectOptimizationen_US
dc.subjectIntelligenceen_US
dc.subjectDecompositionen_US
dc.subjectEvolutionaryen_US
dc.titleA hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
İ Gölcük.pdf
Boyut:
2.8 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam metin / Full text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu