The binary differential search algorithm approach for solving uncapacitated facility location problems

Basit Öğe Kaydı
dc.contributor.authorŞahman, Mehmet Akif
dc.contributor.authorAltun, Adem Alpaslan
dc.contributor.authorDündar, Abdullah Oktay
dc.date.accessioned2020-03-26T19:44:02Z
dc.date.available2020-03-26T19:44:02Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractRecently, many Computational-Intelligence algorithms have been proposed for solving continuous problem. The Differential Search Algorithm (DSA), a computational-intelligence based algorithm inspired by the migration movements of superorganisms, is developed to solve continuous problems. However, DSA proposed for solving problems with continuous search space proposed for solving should be modified for solving binary structured problems. When the DSA is intended for use in binary problems, continuous variables need to be converted into binary format due to solution space structure of this type of problem. In this study, the DSA is modified to solve binary optimization problems by using a conversion approach from continuous values to binary values. The new algorithm has been designated as the binary DSA or BDSA for short. First, when finding donors with the BDSA, four search methods (Bijective, Surjective, Elitist1 and Elitist2) with different iteration numbers are used and tested on 15 UFLP benchmark problems. The Elitist2 approach, which provides the best solution of the four methods, is used in the BDSA, and the results are compared with Continuous Particle Swarm Optimization (CPSO), Continuous Artificial Bee Colony (ABCbin, Improved Binary Particle Swarm Optimization (IBPSO), Binary Artificial Bee Colony (binABC) and Discrete Artificial Bee Colony (DisABC) algorithms using UFLP benchmark problems. Results from the tests and comparisons show that the BDSA is fast, effective and robust for binary optimization. © 2017 American Scientific Publishers.en_US
dc.identifier.doi10.1166/jctn.2017.6258en_US
dc.identifier.endpage684en_US
dc.identifier.issn1546-1955en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage670en_US
dc.identifier.urihttps://dx.doi.org/10.1166/jctn.2017.6258
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35807
dc.identifier.volume14en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherAmerican Scientific Publishersen_US
dc.relation.ispartofJournal of Computational and Theoretical Nanoscienceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectBinary optimizationen_US
dc.subjectConverting binary valueen_US
dc.subjectDifferential search algorithmen_US
dc.subjectUncapacitated facility location problemen_US
dc.titleThe binary differential search algorithm approach for solving uncapacitated facility location problemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu