Path planning is the art of deciding which route to take, based on and expressed in terms of the current internal representation of the terrain. Pathfinding also involves the execution of this theoretical route, by translating the plan from the internal representation in terms of physical movement in the environment. During combat, transfers of military units in the shortest period and with least damage are vitally important. In this study, navigation planning problems, described in semi-dynamic and fully-dynamic scenarios, have been solved using evolutionary algorithm approach. 3-D graph is used to mode the environment. In the first scenario, graph node and edge deletion and cost update operations are applied and the impact of the different parameters of genetic algorithm on the solution has been investigated. In the second scenario, in an environment with possibility of combat, the aim is to find the most secure shortest path by employing genetic algorithm approach dynamically, in case any combat information arrives during the transfer of units.