A Parallel Simulated Annealing Algorithm for Weapon-Target Assignment Problem
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 4
Abstract
Weapon-target assignment (WTA) is a combinatorial optimization problem and is known to be NP-complete. The WTA aims to best assignment of weapons to targets to minimize the total expected value of the surviving targets. Exact methods can solve only small-size problems in a reasonable time. Although many heuristic methods have been studied for the WTA in the literature, a few parallel methods have been proposed. This paper presents parallel simulated algorithm (PSA) to solve the WTA. The PSA runs on GPU using CUDA platform. Multi-start technique is used in PSA to improve quality of solutions. 12 problem instances (up to 200 weapons and 200 targets) generated randomly are used to test the effectiveness of the PSA. Computational experiments show that the PSA outperforms SA on average and runs up to 250x faster than a single-core CPU.
Authors and Affiliations
Emrullah SONUC, Baha SEN, Safak BAYIR
Keywords
Related Articles
- EP ID EP258300
- DOI 10.14569/IJACSA.2017.080412
- Views 100
- Downloads 0
Choice of Knowledge Representation Model for Development of Knowledge Base: Possible Solutions
In current society knowledge, information and intelligent computer systems based on knowledge base play a great role. The ability of an intelligent system to efficiently implement its functions depends on the efficiency...
A Hybrid Data Mining Approach for Intrusion Detection on Imbalanced NSL-KDD Dataset
Intrusion detection systems aim to detect malicious viruses from computer and network traffic, which is not possible using common firewall. Most intrusion detection systems are developed based on machine learning techniq...
ReCSDN: Resilient Controller for Software Defined Networks
Software Defined Networking (SDN) is an emerging network paradigm that provides central control over the network. Although, this simplifies the network management and makes efficient use of network resources, it introduc...
Global Citation Impact rather than Citation Count
The progressing bloom in the tome of scientific literature available today debars researchers from efficiently shrewd the relevant from irrelevant content. Researchers are persistently engrossed in impactful papers, auth...
Multi-Stage Algorithms for Solving a Generalized Capacitated P-median Location Problem
The capacitated p-median location problem is one of the famous problems widely discussed in the literature, but its generalization to a multi-capacity case has not. This generalization, called multi-capacitated location...