Analyzing MBSA Performance Using NetLogo

Optimizing problems are problems of finding the best feasible solution in a set of solutions. Multi Battalion Search Algorithm (MBSA) is a heuristic algorithm used to solve optimization problems by simulating battlefield strategies and tactics to find optimal or near optimal solutions. The strategy of search in MBSA consists of dividing search space into several battalions or cells. The algorithm saves time by performing a parallel search in several areas at the same time. In this paper we utilize a multi-agent tool called Net Logo to simulate and analyze MBSA. This is done in order to assess and visualize MBSA performance. The algorithm simulated in Net Logo is tested against different benchmark problems to further test MBSA efficiency. Net Logo simulations demonstrate the clustering of soldiers in promising areas, and the power of MSBA to do a parallel search in a set of cells.