Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/4820
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Baş, Emine | - |
dc.date.accessioned | 2023-12-09T06:55:11Z | - |
dc.date.available | 2023-12-09T06:55:11Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 1300-7009 | - |
dc.identifier.issn | 2147-5881 | - |
dc.identifier.uri | https://doi.org/10.5505/pajes.2022.58291 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/4820 | - |
dc.description.abstract | Recently, researchers have started to be interested in population-based swarm-based algorithms in optimization due to their simple structure, high optimization performance, and ease of adaptation. Although swarm-based algorithms solve continuous optimization problems, they can also be used to solve binary optimization problems. In continuous optimization, the search space variables try to approach the optimal value, while in discrete optimization, the search space variables are fixed and expressed with real values. In binary optimization, the decision variables take values of 0 and 1 and are basically in the discrete optimization class. In this paper, the proposed Rat Swarm Algorithm (RSA) to solve continuous optimization problems is examined. RSA is an algorithm based on swarm intelligence. RSA was developed by imitating the chasing and attacking behaviors of rats. In this study, the original RSA was updated again to solve binary optimization problems and Binary RSA (BinRSA) was proposed. In BinRSA, four U-shaped and four T-shaped transfer functions are used while converting the continuous search field values to binary values. Thus, eight variants of BinRSA were obtained. These are named as BinRSA1, BinRSA2, BinRSA3, BinRSA4, BinRSA5, BinRSA6, BinRSA7 and BinRSA8. Among these variants, the most successful variant of BinRSA was determined as BinRSA6. Then the BinRSA6 variant was developed by adding crossover and mutation operators and was named GBinRSA. GBinRSA's performance has been tested in knapsack problems. In addition, the success of GBinRSA was compared with different heuristic algorithms selected from the literature. According to the results obtained, it has been seen that the solution quality of the proposed algorithm is effective and comparable. The results showed that GBinRSA is a preferred heuristic for binary optimization problems. | en_US |
dc.language.iso | tr | en_US |
dc.publisher | Pamukkale Univ | en_US |
dc.relation.ispartof | Pamukkale University Journal of Engineering Sciences-Pamukkale Universitesi Muhendislik Bilimleri Dergisi | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | RSA | en_US |
dc.subject | Binary optimization | en_US |
dc.subject | Rat | en_US |
dc.subject | Crossover | en_US |
dc.subject | Mutation | en_US |
dc.subject | Optimization | en_US |
dc.subject | Search | en_US |
dc.title | The new suggested binary rat swarm algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.5505/pajes.2022.58291 | - |
dc.department | KTÜN | en_US |
dc.identifier.volume | 29 | en_US |
dc.identifier.issue | 5 | en_US |
dc.identifier.startpage | 481 | en_US |
dc.identifier.endpage | 492 | en_US |
dc.identifier.wos | WOS:001086174200007 | en_US |
dc.institutionauthor | … | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | tr | - |
Appears in Collections: | WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.