An artificial bee colony algorithm for solving the weapon target assignment problem
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Association for Computing Machinery
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this paper, we deal with the static weapon target assignment (WTA) problem which is a hard combinatorial optimization problem having some industrial applications. The aim of the WTA problem is to find an assignment of weapons to targets with the minimum total survival value of the targets. The WTA problem is known to be NP-complete problem. In this paper, we propose a novel artificial bee algorithm to give an efficient solution to the WTA problem. We test the proposed algorithm with benchmark problem instances and compare it with some other meta-heuristics in the literature. Computational tests show that our algorithm is competitive. © 2017 Association for Computing Machinery.
Açıklama
7th International Conference on Information Communication and Management, ICICM 2017 -- 28 August 2017 through 30 August 2017 -- Moscow -- 131202
Anahtar Kelimeler
Artificial bee colony, Design of algorithms, Weapon target assignment
Kaynak
ACM International Conference Proceeding Series
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
Part F131202