Dynamic electronic asset allocation comparing genetic algorithm with particle swarm optimization

The contribution of this research work can be divided into two main tasks: 1) implementing this Electronic Warfare Asset Allocation Problem (EWAAP) with the Genetic Algorithm (GA); 2) Comparing performance of Genetic Algorithm to Particle Swarm Optimization (PSO) algorithm. This research problem implemented Genetic Algorithm in C++ and used QT Data Visualization for displaying three-dimensional space, pheromone, and Terrain. The Genetic algorithm implementation maintained and preserved the coding style, data structure, and visualization from the PSO implementation. Although the Genetic Algorithm has higher fitness values and better global solutions for 3 or more receivers, it increases the running time. The Genetic Algorithm is around (15-30\%) more accurate for asset counts from 3 to 6 but requires (26-82\%) more computational time. When the allocation problem complexity increases by adding 3D space, pheromones and complex terrains, the accuracy of GA is 3.71\% better but the speed of GA is 121\% slower than PSO. In summary, the Genetic Algorithm gives a better global solution in some cases but the computational time is higher for the Genetic Algorithm with than Particle Swarm Optimization.

Author dc:creator

• Islam, Md Saiful

Advisor dc:contributor.advisor

• Christopher, Lauren A.

• Dynamic Electronic Asset Allocation
• Genetic Algorithm
• Particle Swarm Optimization

Language dc:language.iso

en

Identifier URI

http://dx.doi.org/10.7912/C2/2470

OAI identifier oai:identifier

oai:scholarworks.indianapolis.iu.edu:1805/17916