Solving Weapon-Target Assignment Problem with Salp Swarm Algorithm

Basit Öğe Kaydı
dc.authoridAVCI, Dr. Isa/0000-0001-7032-8018
dc.contributor.authorAvci, Isa
dc.contributor.authorYildirim, Mehmet
dc.date.accessioned2024-09-29T16:06:32Z
dc.date.available2024-09-29T16:06:32Z
dc.date.issued2023
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe weapon target problem is a combinatorial optimization problem. It aims to have the weapons on target properly assigned for the intended purposes. When focused on its target, it does things with its effective attack research in mind. It is an ongoing problem program to minimize survivors. This study, using the weapon target assignment model calculates the expected probabilities on the target with the salp model. The nature of this SHA model is designed to be appropriately predicted for this particular use. The Salp Swarm Algorithm (SSA) is a metaheuristic method of methods approaching the solution set as an approximation. Optimum solution or optimum example is in a working example. This study was done with 12 problem examples (200 training and 200 targets with pleasure to observe, to test the efficiency of SSA). In the problem, the iteration resulted in optimum results at the end of the definite usage time. Best value included 48.355 for WTA1, 92.654 for WTA2, 174.432 for WTA3, 155.658 for WTA4, 250.784 for WTA5, 284.967 for WTA6, 247.458 for WTA7, 362.636 for WTA8, 524.732 for WTA9, 548.580 for WTA10, 601.654 for WTA11, and WTA16812. It was obtained by finding in 200,000 iterations and the result value was 50. After 200000 improvements, it was observed to relax to increase iteration. The use of barter when generating new solutions to the problem. To find out the fitness values, mean, best, and worst values were found.en_US
dc.identifier.doi10.17559/TV-20220113192727
dc.identifier.endpage23en_US
dc.identifier.issn1330-3651
dc.identifier.issn1848-6339
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85144627918en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage17en_US
dc.identifier.urihttps://doi.org/10.17559/TV-20220113192727
dc.identifier.urihttps://hdl.handle.net/20.500.14619/6893
dc.identifier.volume30en_US
dc.identifier.wosWOS:000924354900001en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUniv Osijek, Tech Facen_US
dc.relation.ispartofTehnicki Vjesnik-Technical Gazetteen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectmetaheuristic optimizationen_US
dc.subjectparticle-wide optimizationen_US
dc.subjectsalp swarm algorithmen_US
dc.subjectsearch weaponsen_US
dc.subjecttarget assignmenten_US
dc.titleSolving Weapon-Target Assignment Problem with Salp Swarm Algorithmen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu