Troop Search Optimization Algorithm for Unconstrained Problems

In defence sector, the combined effort of both commander and captain helps to prepare an efficient troop with optimized strength, before each combat operation. Acontinuous attempt is being maintained in order to maximize both protection of the combatants in the troop and rate of killing enemies. Hence during the process of selecting the best troop, there could be a number of readjustments, shuffling and exchanging mechanisms applied over the combatants. These mechanisms or the course of actions taken by a commander/captain has been modelled to an optimization algorithm, proposed as 'Troop Search Optimization (TSO) algorithm' in this paper. TSO takes utmost care to balance both exploration and exploitation in the population during simulation. In order to realize the better strength of TSO together with proposed crossover, a set of 11 unconstrained benchmark problems have been solved by TSO and the results are compared. The numerical results and statistical analysis confirm the better strength of TSO over many of the recently established bio-inspired algorithms including ABC, GABC, TLBO, ITLBO, HS and IBA.