Automatic Military One-Point Located Symbols Placement Based on the Genetic Algorithm

The paper proposes a solution to the problem of military one-point located symbols placement whereby a computer program plots automatically a deployment map. The solution treats the problem as combination optimization of space competition and consists of the following steps. Firstly, prepare 5 or 9 optional plotting positions for every symbol. Secondly, build the evaluation function for every optional position and collision situation, and hence build the evaluation model of the whole map. Finally, use the genetic algorithm to iteratively optimize the evaluation function value, thus obtaining a satisfactory plotting map. Our experiments demonstrate that the solution is effective.